Lagrangean decomposition: A model yielding stronger lagrangean bounds
- 1 June 1987
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 39 (2) , 215-228
- https://doi.org/10.1007/bf02592954
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A Multiplier Adjustment Method for the Generalized Assignment ProblemManagement Science, 1986
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimalityMathematical Programming, 1985
- A weighted matroid intersection algorithmJournal of Algorithms, 1981
- Calculating surrogate constraintsMathematical Programming, 1980
- A dual algorithm for the constrained shortest path problemNetworks, 1980
- Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure NetworksOperations Research, 1980
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location ProblemPublished by Elsevier ,1977
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Surrogate Mathematical ProgrammingOperations Research, 1970