Heuristics for the capacitated plant location model
- 1 March 1983
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 12 (3) , 253-261
- https://doi.org/10.1016/0377-2217(83)90195-9
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problemEuropean Journal of Operational Research, 1983
- 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
- On the use of tree-indexing methods in transportation algorithmsEuropean Journal of Operational Research, 1978
- Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location ProblemPublished by Elsevier ,1977
- An efficient heuristic procedure for the capacitated warehouse location problemNaval Research Logistics Quarterly, 1974
- An efficient heuristic procedure for the uncapacitated warehouse location problemNaval Research Logistics Quarterly, 1973
- Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration ConstraintsA I I E Transactions, 1971
- Heuristic Methods for Location-Allocation ProblemsSIAM Review, 1964