An algorithm for solving large capacitated warehouse location problems
- 29 February 1988
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 33 (3) , 314-325
- https://doi.org/10.1016/0377-2217(88)90175-0
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A partial dual algorithm for the capacitated warehouse location problemEuropean Journal of Operational Research, 1986
- Facility location models for distribution planningEuropean Journal of Operational Research, 1985
- ADD-heuristics' starting procedures for capacitated plant location modelsEuropean Journal of Operational Research, 1985
- Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse LocationJournal of the Operational Research Society, 1985
- Heuristics for the capacitated plant location modelEuropean 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
- A search tree algorithm for plant location problemsEuropean Journal of Operational Research, 1981
- A note on pivoting in transportation codesEuropean Journal of Operational Research, 1978
- On the use of tree-indexing methods in transportation algorithmsEuropean Journal of Operational Research, 1978