A cutting plane algorithm for the capacitated facility location problem
- 6 December 2007
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 43 (1) , 39-65
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Computational study of large-scale p-Median problemsMathematical Programming, 2006
- The volume algorithm: producing primal solutions with a subgradient methodMathematical Programming, 2000
- Improved Approximation Algorithms for Capacitated Facility Location Problems1999
- Capacitated facility location: Separation algorithms and computational experienceMathematical Programming, 1998
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software, 1996
- Capacitated Facility Location: Valid Inequalities and FacetsMathematics of Operations Research, 1995
- Lagrangean heuristics for location problemsEuropean Journal of Operational Research, 1993
- A comparison of heuristics and relaxations for the capacitated plant location problemEuropean Journal of Operational Research, 1991
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Valid inequalities and facets of the capacitated plant location problemMathematical Programming, 1989