A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- 14 May 1993
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 66 (3), 305-312
- https://doi.org/10.1016/0377-2217(93)90219-d
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A comparison of heuristics and relaxations for the capacitated plant location problemEuropean Journal of Operational Research, 1991
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source ConstraintsJournal of the Operational Research Society, 1986
- A heuristic Lagrangean algorithm for the capacitated plant location problem — A commentEuropean Journal of Operational Research, 1986
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and boundsNetworks, 1985
- A heuristic lagrangean algorithm for the capacitated plant location problemEuropean Journal of Operational Research, 1984
- An Algorithm for the Fixed-Charge Assigning Users to Sources ProblemJournal of the Operational Research Society, 1983
- A single source transportation algorithmComputers & Operations Research, 1980
- 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
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974