When Lift-and-Project Cuts Are Different

DOI10.1287/ijoc.2019.0943OpenAlexW3005033146MaRDI QIDQ3386803

Egon Balas, Thiago Serra

Publication date: 7 January 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingintersection cutslift-and-project cutsGomory cutsmultirow cuts

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• MIPLIB
• MIPLIB2003
• lifting

Cites Work

• On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
• Unique lifting of integer variables in minimal inequalities
• Intersection cuts from multiple rows: a disjunctive programming approach
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• Cook, Kannan and Schrijver's example revisited
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
• Strengthening cuts for mixed integer programs
• Disjunctive programming: Properties of the convex hull of feasible points
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Split closure and intersection cuts
• Lift-and-project for general two-term disjunctions
• A geometric approach to cut-generating functions
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• On the facets of mixed integer programs with two integer variables and two constraints
• MIPLIB 2003
• The strength of multi-row models
• Two row mixed-integer cuts via lifting
• Experiments with Two-Row Cuts from Degenerate Tableaux
• Computational Experiments with Cross and Crooked Cross Cuts
• On the Practical Strength of Two-Row Tableau Cuts
• A Geometric Perspective on Lifting
• Minimal Valid Inequalities for Integer Constraints
• Maximal Lattice-Free Convex Sets in Linear Subspaces
• Computing with Multi-row Gomory Cuts
• Disjunctive Programming
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming