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.

MoreLess

Year of publication:	2008-09-10
Authors:	Andreica, Mugurel Ionut ; Andreica, Cristina Teodora ; Andreica, Madalina Ecaterina
Institutions:	HAL
Subject:	facility location \| binary matrix \| maximum perimeter sum rectangle \| largest square \| largest diamond

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Post-Print.
Type of publication:	Book / Working Paper
Language:	English
Notes:	View the original document on HAL open archive server: http://hal.archives-ouvertes.fr/hal-00323318 Published - Presented, International Symposium on Social Development and Economic Performance, 2008, Satu Mare, Romania
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10008790406