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.
|Number of pages||12|
|Journal||International Journal of Computational Geometry and Applications|
|State||Published - 1 Jan 2000|
- Facility location
- Orthogonal range search
- Parametric search