Lagrangian dual ascent by generalized linear programming
- 1 August 1989
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 8 (4) , 189-196
- https://doi.org/10.1016/0167-6377(89)90059-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Generalized Linear Programming Solves the DualManagement Science, 1976
- Using duality to solve discrete optimization problems: Theory and computational experiencePublished by Springer Nature ,1975
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- Minimization of unsmooth functionalsUSSR Computational Mathematics and Mathematical Physics, 1969
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961
- Decomposition Principle for Linear ProgramsOperations Research, 1960