Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
From MaRDI portal
Publication:1043853
DOI10.1007/s12532-009-0006-4zbMath1180.90206OpenAlexW2080153401WikidataQ115144378 ScholiaQ115144378MaRDI QIDQ1043853
Publication date: 9 December 2009
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-009-0006-4
Related Items
Reformulating the disjunctive cut generating linear program, On optimizing over lift-and-project closures, Computational Experiments with Cross and Crooked Cross Cuts, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, A heuristic to generate rank-1 GMI cuts, Generalized intersection cuts and a new cut generating paradigm, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, Lift-and-Project Cuts for Mixed Integer Convex Programs, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, A relax-and-cut framework for Gomory mixed-integer cuts, On the separation of disjunctive cuts, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, When Lift-and-Project Cuts Are Different
Uses Software
Cites Work
- MIR closures of polyhedral sets
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Optimizing over the split closure
- Gomory cuts revisited
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
