Lagrangean Relaxation Applied to Capacitated Facility Location Problems
- 1 March 1978
- journal article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 10 (1), 40-47
- https://doi.org/10.1080/05695557808975181
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Practical Solution of Large Mixed Integer Programming Problems with UmpireManagement Science, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration ConstraintsA I I E Transactions, 1971
- Technical Note—An Improved Branch-and-Bound Method for Integer ProgrammingOperations Research, 1971
- A branch‐bound algorithm for the capacitated facilities location problemNaval Research Logistics Quarterly, 1969
- A Heuristic Program for Locating WarehousesManagement Science, 1963