Abstract
We present efficient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the first we seek a location that maximizes a weighted distance function between the facility and the sites, and in the second we find a location that minimizes the sum (or sum of the squares) of the distances of k of the sites from the facility.
| Original language | English |
|---|---|
| Pages (from-to) | 523-534 |
| Number of pages | 12 |
| Journal | International Journal of Computational Geometry and Applications |
| Volume | 10 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 Jan 2000 |
Keywords
- Facility location
- Optimization
- Orthogonal range search
- Parametric search
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics