Locating Restricted Facilities on Binary Maps
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by HAL in its series Post-Print with number hal-00323318.
Date of creation: 10 Sep 2008
Date of revision:
Publication status: Published - Presented, International Symposium on Social Development and Economic Performance, 2008, Satu Mare, Romania
Note: View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00323318
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/
facility location; binary matrix; maximum perimeter sum rectangle; largest square; largest diamond;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2008-09-29 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.