A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- 1 October 1984
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 18 (1) , 35-43
- https://doi.org/10.1016/0377-2217(84)90258-3
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- A Plant and Warehouse Location ProblemJournal of the Operational Research Society, 1977
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- 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
- A cost function property for plant location problemsMathematical Programming, 1974
- An Efficient Branch and Bound Algorithm for the Warehouse Location ProblemManagement Science, 1972
- Site Location via Mixed-integer ProgrammingJournal of the Operational Research Society, 1972
- A branch‐bound algorithm for the capacitated facilities location problemNaval Research Logistics Quarterly, 1969
- A Branch-Bound Algorithm for Plant LocationOperations Research, 1966