Locating Restricted Facilities on Binary Maps
In this paper we consider several facility location problems with applications to cost and social welfare optimization, when the area map is encoded as a binary (0,1) mxn matrix. We present algorithmic solutions for all the problems. Some cases are too particular to be used in practical situations, but they are at least a starting point for more generic solutions.
|Date of creation:||20 Jun 2008|
|Publication status:||Published in International Symposium on Social Development and Economic Performance, Jun 2008, Satu Mare, Romania. 89, pp.87-91, 2008|
|Note:||View the original document on HAL open archive server: https://hal.archives-ouvertes.fr/hal-00323318v2|
|Contact details of provider:|| Web page: https://hal.archives-ouvertes.fr/|
When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-00323318. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD)
If references are entirely missing, you can add them using this form.