Locating Restricted Facilities on Binary Maps

TL;DR

This paper addresses facility location problems on binary maps, proposing algorithmic solutions for optimizing costs and social welfare, serving as foundational work for more general approaches.

Contribution

It introduces algorithmic solutions for various facility location problems on binary maps, some of which are initial steps towards more comprehensive methods.

Findings

Developed algorithms for facility placement on binary maps.

Provided solutions for cost and social welfare optimization.

Laid groundwork for future, more general algorithms.

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.