An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- 31 December 1991
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 18 (2) , 167-182
- https://doi.org/10.1016/0305-0548(91)90087-8
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- A partial dual algorithm for the capacitated warehouse location problemEuropean Journal of Operational Research, 1986
- 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
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location ProblemManagement Science, 1977
- Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location ProblemPublished by Elsevier ,1977
- An Efficient Branch and Bound Algorithm for the Warehouse Location ProblemManagement Science, 1972
- A branch‐bound algorithm for the capacitated facilities location problemNaval Research Logistics Quarterly, 1969
- A Branch-Bound Algorithm for Plant LocationOperations Research, 1966