A partial dual algorithm for the capacitated warehouse location problem
- 31 January 1986
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 23 (1) , 48-56
- https://doi.org/10.1016/0377-2217(86)90213-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problemEuropean Journal of Operational Research, 1983
- An Improved Algorithm for the Capacitated Facility Location ProblemJournal of the Operational Research Society, 1978
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location ProblemManagement Science, 1977
- Validation of subgradient optimizationMathematical Programming, 1974
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation ProblemsManagement Science, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- A branch‐bound algorithm for the capacitated facilities location problemNaval Research Logistics Quarterly, 1969