A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem
- 1 October 2000
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 126 (2), 408-421
- https://doi.org/10.1016/s0377-2217(99)00300-8
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- An LP-based heuristic for two-stage capacitated facility location problemsJournal of the Operational Research Society, 1999
- A Branch and Bound Algorithm for An Uncapacitated Facility Location Problem with a Side ConstraintInternational Transactions in Operational Research, 1998
- Efficient cuts in Lagrangean ‘Relax-and-cut’ schemesEuropean Journal of Operational Research, 1998
- Heuristics for the generalised assignment problem: simulated annealing and tabu search approachesOR Spectrum, 1995
- The capacitated plant location problemEuropean Journal of Operational Research, 1995
- A Lagrangian heuristic for the capacitated plant location problem with single source constraintsEuropean Journal of Operational Research, 1993
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcingOR Spectrum, 1990
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source ConstraintsJournal of the Operational Research Society, 1986
- 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