Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- 4 May 1990
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 46 (1) , 73-83
- https://doi.org/10.1016/0377-2217(90)90299-q
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A Lagrangean dual ascent algorithm for simple plant location problemsEuropean Journal of Operational Research, 1988
- A Multiplier Adjustment Method for the Generalized Assignment ProblemManagement Science, 1986
- A Cross Decomposition Algorithm for Capacitated Facility LocationOperations Research, 1986
- Inverse Optimization: An Application to the Capacitated Plant Location ProblemManagement Science, 1981
- A direct dual method for the mixed plant location problem with some side constraintsMathematical Programming, 1979
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- An Efficient Branch and Bound Algorithm for the Warehouse Location ProblemManagement Science, 1972
- Plant Location with Generalized Search OriginManagement Science, 1969
- A Heuristic Program for Locating WarehousesManagement Science, 1963