A branch‐bound algorithm for the capacitated facilities location problem
- 1 September 1969
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 16 (3) , 331-344
- https://doi.org/10.1002/nav.3800160306
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Branch-Bound Algorithm for Plant LocationOperations Research, 1966
- Warehouse Location Under Continuous Economies of ScaleManagement Science, 1966
- Integer Programming: Methods, Uses, ComputationsManagement Science, 1965
- Plant Location Under Economies-of-Scale—Decentralization and ComputationManagement Science, 1964
- A Heuristic Program for Locating WarehousesManagement Science, 1963
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961
- An Out-of-Kilter Method for Minimal-Cost Flow ProblemsJournal of the Society for Industrial and Applied Mathematics, 1961
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960