A lift-and-project cutting plane algorithm for mixed 0–1 programs
- 1 January 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 58 (1-3) , 295-324
- https://doi.org/10.1007/bf01581273
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An additive bounding procedure for the asymmetric travelling salesman problemMathematical Programming, 1992
- Sequential convexification in reverse convex and disjunctive programmingMathematical Programming, 1989
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1985
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980
- Strengthening cuts for mixed integer programsEuropean Journal of Operational Research, 1980
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- Disjunctive ProgrammingPublished by Elsevier ,1979
- A Capital Budgeting Heuristic Algorithm Using Exchange OperationsA I I E Transactions, 1974
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971