Characterization of the split closure via geometric lifting

DOI10.1016/j.ejor.2014.12.018zbMath1346.90604arXiv1701.06679OpenAlexW2055193102MaRDI QIDQ319191

Marco Molinaro, Amitabh Basu

Publication date: 6 October 2016

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

Full work available at URL: https://arxiv.org/abs/1701.06679

zbMATH Keywords

integer programmingsplit cutcut-generating functioncutting-planegeometric lifting

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(t\)-branch split cuts for mixed-integer programs
• A heuristic to generate rank-1 GMI cuts
• On the relative strength of split, triangle and quadrilateral cuts
• Chvátal closures for mixed integer programming problems
• Valid inequalities for mixed integer linear programs
• A relax-and-cut framework for Gomory mixed-integer cuts
• Split closure and intersection cuts
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• On optimizing over lift-and-project closures
• Optimizing over the split closure
• Edmonds polytopes and a hierarchy of combinatorial problems
• Gomory cuts revisited
• Intersection Cuts with Infinite Split Rank
• K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
• A Geometric Perspective on Lifting
• Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Disjunctive Programming
• Cut-Generating Functions
• Mixed Integer Programming: Analyzing 12 Years of Progress
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming

This page was built for publication: Characterization of the split closure via geometric lifting