Lagrangean relaxation for integer programming
- 1 January 1974
- book chapter
- Published by Springer Nature
- p. 82-114
- https://doi.org/10.1007/bfb0120690
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Improved penalty calculations for a mixed integer branch-and-bound algorithmMathematical Programming, 1974
- Constructive Duality in Integer ProgrammingSIAM Journal on Applied Mathematics, 1974
- Practical Solution of Large Mixed Integer Programming Problems with UmpireManagement Science, 1974
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part IOperations Research, 1973
- Duality in Nonlinear Programming: A Simplified Applications-Oriented DevelopmentSIAM Review, 1971
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- Letter to the Editor—Finding Everett's Lagrange Multipliers by Linear ProgrammingOperations Research, 1966
- An Algorithm for the Solution of Mixed Integer Programming ProblemsManagement Science, 1966
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963