Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts

DOI10.1016/j.ejor.2011.04.009zbMath1218.90138OpenAlexW2062502816MaRDI QIDQ2275620

Achim Koberstein, Uwe H. Suhl, Franz Wesselmann

Publication date: 9 August 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.04.009

zbMATH Keywords

integer programmingcutting planesGomory mixed-integer cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Uses Software

• SCIP
• MIPLIB
• CPLEX
• Benchmarks for Optimization Software
• MIPLIB2003
• MOPS
• Decision tree for optimization software

Cites Work

• Unnamed Item
• Progress in computational mixed integer programming -- a look back from the other side of the tipping point
• Revival of the Gomory cuts in the 1990's
• SCIP: solving constraint integer programs
• Chvátal closures for mixed integer programming problems
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
• MOPS -- Mathematical optimization system
• 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
• MIPLIB 2003
• Gomory cuts revisited
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming