Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra

DOI10.1007/s10107-011-0455-1zbMath1269.90068OpenAlexW2154900771MaRDI QIDQ715090

Santanu S. Dey, Oktay Günlük, Sanjeeb Dash

Publication date: 15 October 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-011-0455-1

zbMATH Keywords

2D lattice-free cutstwo-row continous group relaxationunimodular cross cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (15)

Theoretical challenges towards cutting-plane selection ⋮ On the polyhedrality of cross and quadrilateral closures ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ Lattice closures of polyhedra ⋮ On mixed-integer sets with two integer variables ⋮ Monoidal cut strengthening revisited ⋮ Design and Verify: A New Scheme for Generating Cutting-Planes ⋮ Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs ⋮ On the relative strength of different generalizations of split cuts ⋮ Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ The strength of multi-row models ⋮ When Lift-and-Project Cuts Are Different ⋮ On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width

Cites Work

• Unnamed Item
• Composite lifting of group inequalities and an application to two-row mixing inequalities
• Strengthening lattice-free cuts using non-negativity
• On the relative strength of split, triangle and quadrilateral cuts
• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• Equivalence between intersection cuts and the corner polyhedron
• On degenerate multi-row Gomory cuts
• Strengthening cuts for mixed integer programs
• Corner polyhedra and their connection with cutting planes
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• On the facets of mixed integer programs with two integer variables and two constraints
• Two row mixed-integer cuts via lifting
• Mixed-integer sets from two rows of two adjacent simplex bases
• Experiments with Two-Row Cuts from Degenerate Tableaux
• Constrained Infinite Group Relaxations of MIPs
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• 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
• On Lifting Integer Variables in Minimal Inequalities
• Experiments with Two Row Tableau Cuts
• Characterization of facets for multiple right-hand choice linear programs
• Disjunctive Programming
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Some continuous functions related to corner polyhedra, II
• On the rank of mixed 0,1 polyhedra.

This page was built for publication: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra