LP-based approximation algorithms for capacitated facility location
- 18 May 2010
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 131 (1-2) , 365-379
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Primal-Dual Schema for Capacitated Covering Problems2008
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover InequalitiesMathematics of Operations Research, 2008
- Approximation Algorithms for Metric Facility Location ProblemsSIAM Journal on Computing, 2006
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location ProblemMathematics of Operations Research, 2005
- Improved approximation algorithms for capacitated facility location problemsMathematical Programming, 2004
- LP-based Approximation Algorithms for Capacitated Facility LocationLecture Notes in Computer Science, 2004
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxationJournal of the ACM, 2001
- Analysis of a Local Search Heuristic for Facility Location ProblemsJournal of Algorithms, 2000
- An approximation algorithm for the generalized assignment problemMathematical Programming, 1993
- Valid Linear Inequalities for Fixed Charge ProblemsOperations Research, 1985