Greedy Strikes Back: Improved Facility Location Algorithms
Open Access
- 1 April 1999
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 31 (1) , 228-248
- https://doi.org/10.1006/jagm.1998.0993
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Analysis of a Local Search Heuristic for Facility Location ProblemsJournal of Algorithms, 2000
- Improved Approximation Algorithms for Uncapacitated Facility LocationPublished by Springer Nature ,1998
- Some optimal inapproximability resultsPublished by Association for Computing Machinery (ACM) ,1997
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- Approximation algorithms for geometric median problemsInformation Processing Letters, 1992
- Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and boundsNetworks, 1985
- Heuristics for the fixed cost median problemMathematical Programming, 1982
- Cluster Analysis: An Application of Lagrangian RelaxationManagement Science, 1979
- Plant Location Under Economies-of-Scale—Decentralization and ComputationManagement Science, 1964
- A Heuristic Program for Locating WarehousesManagement Science, 1963