A heuristic lagrangean algorithm for the capacitated plant location problem
- 1 February 1984
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 15 (2), 212-226
- https://doi.org/10.1016/0377-2217(84)90211-x
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Inverse Optimization: An Application to the Capacitated Plant Location ProblemManagement Science, 1981
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- A Survey of Lagrangean Techniques for Discrete OptimizationAnnals of Discrete Mathematics, 1979
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978
- An Analysis of the Greedy Heuristic for Independence SystemsAnnals of Discrete Mathematics, 1978
- An analysis of approximations for maximizing submodular set functions—IIPublished by Springer Nature ,1978
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Multicommodity Distribution System Design by Benders DecompositionManagement Science, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974