Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- 1 January 1983
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 12 (1) , 19-28
- https://doi.org/10.1016/0377-2217(83)90179-0
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Cross decomposition for mixed integer programmingMathematical Programming, 1983
- A tree search algorithm for the p-median problemEuropean Journal of Operational Research, 1982
- A direct dual method for the mixed plant location problem with some side constraintsMathematical Programming, 1979
- An Improved Algorithm for the Capacitated Facility Location ProblemJournal of the Operational Research Society, 1978
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- Modeling Facility Location Problems as Generalized Assignment ProblemsManagement Science, 1977
- Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location ProblemPublished by Elsevier ,1977
- Validation of subgradient optimizationMathematical Programming, 1974
- Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration ConstraintsA I I E Transactions, 1971
- Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location ProblemOperations Research, 1969