Polyhedral annexation in mixed integer and combinatorial programming
Open Access
- 1 December 1975
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 9 (1) , 161-188
- https://doi.org/10.1007/bf01681342
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Disjunctive programming: Properties of the convex hull of feasible pointsDiscrete Applied Mathematics, 1998
- Convex and polaroid extensionsNaval Research Logistics Quarterly, 1977
- Polyhedral convexity cuts and negative edge extensionsMathematical Methods of Operations Research, 1974
- Convexity cuts for multiple choice problemsDiscrete Mathematics, 1973
- Enumerative Cuts: IOperations Research, 1973
- The Generalized Lattice-Point ProblemOperations Research, 1973
- Convexity Cuts and Cut SearchOperations Research, 1973
- Integer programming and convex analysis: Intersection cuts from outer polarsMathematical Programming, 1972
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965