When are NP-hard location problems easy?
- 1 October 1984
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 1 (3) , 201-214
- https://doi.org/10.1007/bf01874389
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Probabilistic analysis of two euclidean location problemsRAIRO. Informatique théorique, 1983
- Heuristics for the fixed cost median problemMathematical Programming, 1982
- Steinhaus's geometric location problem for random samples in the planeAdvances in Applied Probability, 1982
- Worst-Case and Probabilistic Analysis of a Geometric Location ProblemSIAM Journal on Computing, 1981
- Probabilistic analysis of some euclidean clustering problemsDiscrete Applied Mathematics, 1980
- Combinatorial Optimization: What is the State of the ArtMathematics of Operations Research, 1980
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977