Improved algorithms for placing undesirable facilities

Computers and Operations Research

Volumn 29, Issue 13, 2002, Pages 1859-1872

  Katz, Matthew J ^a   Kedem, Klara ^a   Segal, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Computational geometry; Facility location; Maxmin; Minsum

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY;

MULTI-FACILITY LOCATION;

OPERATIONS RESEARCH;

ALGORITHM; FACILITY LOCATION; LAND USE PLANNING; PLANNING METHOD;

EID: 0036833007     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00063-6     Document Type: Article

References (15)

1. Obnoxious facility location: Complete service with minimal harm
2. Optimal facility location under various distance functions
3. Multi-facility location using a maximum criterion and rectangular distances
4. The rectilinear distance minsum problem with minimum distance constraints
5. Finding the circle or rectangle containing the minimum weight of points
6. The single facility location problem with minimum distance constraints
7. Generalized selection and ranking: Sorted matrices
8. Efficient solution of the two-line center problem and other geometric problems via sorted matrices
9. Fractional cascading: I. A data structuring technique
10. Fractional cascading: II. Applications
11. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles