## Abstract

We improve several existing algorithms for determining the location of one or more undesirable facilities amidst a set P of n demand points, under various constraints and distance functions. We assume that the demand points reside within some given bounded region R. Applying concepts and techniques from Computational Geometry, we provide efficient algorithms for the following problems: (1) Maxmin multi-facility location: Locate k undesirable facilities within R under the constraints that the smallest distance between each demand point and the facilities is at least a given r, and the distance between any two facilities is at least a given D. Under the L∞ (L_{1}) norm we present efficient algorithms for any k, and under the L_{2} norm we can locate efficiently two such facilities. In all cases, R is assumed to be an axis-parallel rectangle. (2) Minsum coverage: Given a set of weighted demand points contained in an axis-parallel rectangular region R, and given a smaller axis-parallel rectangle Q, place Q within R such that the sum of weights of the demand points contained in Q is minimized.

Original language | English |
---|---|

Pages (from-to) | 1859-1872 |

Number of pages | 14 |

Journal | Computers and Operations Research |

Volume | 29 |

Issue number | 13 |

DOIs | |

State | Published - 1 Nov 2002 |

## Keywords

- Computational geometry
- Facility location
- Maxmin
- Minsum

## ASJC Scopus subject areas

- Computer Science (all)
- Modeling and Simulation
- Management Science and Operations Research