Locating Restricted Facilities on Binary Maps
classification
💻 cs.DS
keywords
binaryproblemssolutionsalgorithmicapplicationsareacasesconsider
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.