A local search approximation algorithm for the uniform capacitated k-facility location problem
- 30 September 2017
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 35 (2) , 409-423
Abstract
No abstract availableKeywords
Funding Information
- Higher Educational Science and Technology Program of Shandong Province (J15LN22)
- Natural Sciences and Engineering Research Council of Canada (283106)
- National Natural Science Foundation of China (11531014)
This publication has 27 references indexed in Scilit:
- Approximation algorithms for hard capacitated k-facility location problemsEuropean Journal of Operational Research, 2015
- A 3-approximation algorithm for the facility location problem with uniform capacitiesMathematical Programming, 2012
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location ProblemSIAM Journal on Computing, 2010
- Improved Combinatorial Algorithms for Facility Location ProblemsSIAM Journal on Computing, 2005
- Improved approximation algorithms for capacitated facility location problemsMathematical Programming, 2004
- Local Search Heuristics for k-Median and Facility Location ProblemsSIAM Journal on Computing, 2004
- Improved Approximation Algorithms for the Uncapacitated Facility Location ProblemSIAM Journal on Computing, 2003
- A Constant-Factor Approximation Algorithm for the k-Median ProblemJournal of Computer and System Sciences, 2002
- Greedy Strikes Back: Improved Facility Location AlgorithmsJournal of Algorithms, 1999
- Comments on the note of FriezeMathematical Programming, 1974