A Survey of Lagrangean Techniques for Discrete Optimization
- 1 January 1979
- book chapter
- Published by Elsevier in Annals of Discrete Mathematics
Abstract
No abstract availableThis publication has 41 references indexed in Scilit:
- Using duality to solve discrete optimization problems: Theory and computational experiencePublished by Springer Nature ,1975
- Constructive Duality in Integer ProgrammingSIAM Journal on Applied Mathematics, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Steepest Ascent for Large Scale Linear ProgramsSIAM Review, 1972
- Integer Programming over a Finite Additive GroupSIAM Journal on Control, 1969
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- Synthesis of a Communication NetworkJournal of the Society for Industrial and Applied Mathematics, 1964
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956
- Three Problems in Rationing CapitalThe Journal of Business, 1955