A Lagrangean dual ascent algorithm for simple plant location problems
- 31 May 1988
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 35 (2) , 193-200
- https://doi.org/10.1016/0377-2217(88)90029-x
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An algorithm for the solution of the 0–1 knapsack problemComputing, 1982
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location ProblemPublished by Elsevier ,1977
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Plant Location with Generalized Search OriginManagement Science, 1969
- Algorithms for the Simple Plant-Location Problem with Some Side ConditionsOperations Research, 1969
- Direct Search Algorithms for Zero-One and Mixed-Integer ProgrammingOperations Research, 1967