A comparison of heuristics and relaxations for the capacitated plant location problem
- 15 February 1991
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 50 (3), 280-297
- https://doi.org/10.1016/0377-2217(91)90261-s
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- ADD-heuristics' starting procedures for capacitated plant location modelsEuropean Journal of Operational Research, 1985
- Lagrangian relaxation for the star‐star concentrator location problem: Approximation algorithm and boundsNetworks, 1985
- Locational analysisEuropean Journal of Operational Research, 1983
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problemEuropean Journal of Operational Research, 1983
- Linear Relaxations of the Capacitated Warehouse Location ProblemJournal of the Operational Research Society, 1982
- Facility location models for planning a transatlantic communications networkEuropean Journal of Operational Research, 1981
- An Improved Algorithm for the Capacitated Facility Location ProblemJournal of the Operational Research Society, 1978
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- An efficient heuristic procedure for the capacitated warehouse location problemNaval Research Logistics Quarterly, 1974
- An operator theory of parametric programming for the transportation problem‐INaval Research Logistics Quarterly, 1972