Branch and bound experiments in zero-one programming
- 1 January 1974
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Enumerative Cuts: IOperations Research, 1973
- Integer programming and convex analysis: Intersection cuts from outer polarsMathematical Programming, 1972
- Experiments in mixed-integer linear programmingMathematical Programming, 1971
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- Surrogate ConstraintsOperations Research, 1968
- Discrete Programming by the Filter MethodOperations Research, 1967
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960