Locating Restricted Facilities on Binary Maps
Mugurel Ionut Andreica (),
Cristina Teodora Andreica () and
Madalina Ecaterina Andreica ()
Additional contact information
Mugurel Ionut Andreica: Parallel and Distributed Systems Laboratory [Bucarest] - UPB - Polytechnic University of Bucharest [Romania] = Université Politehnica de Bucarest [Roumanie] = Universitatea Națională de Știință și Tehnologie Politehnica București [România]
Cristina Teodora Andreica: Management and Finances Center - Commercial Academy Satu Mare
Madalina Ecaterina Andreica: CSIE ASE - The Faculty of Economic Cybernetics, Statistics and Informatics, Academia de Studii Economice din Bucureşti - A.S.E. - The Bucharest University of Economic Studies / Academia de Studii Economice din Bucureşti
Authors registered in the RePEc Author Service: Madalina Ecaterina Popescu
Post-Print from HAL
Abstract:
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.
Keywords: facility location; binary matrix; maximum perimeter sum rectangle; largest square; largest diamond (search for similar items in EconPapers)
Date: 2008-06-20
Note: View the original document on HAL open archive server: https://hal.science/hal-00323318v2
References: View complete reference list from CitEc
Citations:
Published in International Symposium on Social Development and Economic Performance, Jun 2008, Satu Mare, Romania. pp.87-91
Downloads: (external link)
https://hal.science/hal-00323318v2/document (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00323318
Access Statistics for this paper
More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().