A constructive characterization of the split closure of a mixed integer linear program

DOI10.1016/j.orl.2005.12.005zbMath1278.90277OpenAlexW2083016760MaRDI QIDQ2643814

Juan Pablo Vielma

Publication date: 27 August 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.12.005

zbMATH Keywords

cutting planesmixed-integer linear programmingsplit cutssplit closurelattice bases

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (9)

MIR closures of polyhedral sets ⋮ On the polyhedrality of cross and quadrilateral closures ⋮ A note on the split rank of intersection cuts ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Equivalence between intersection cuts and the corner polyhedron ⋮ The split closure of a strictly convex body ⋮ Split cuts and extended formulations for mixed integer conic quadratic programming ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets

Cites Work

• Chvátal closures for mixed integer programming problems
• 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
• On the separation of split cuts and related inequalities
• Cutting planes from a mixed integer Farkas lemma.
• Split closure and intersection cuts
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Unnamed Item

This page was built for publication: A constructive characterization of the split closure of a mixed integer linear program