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

DOI10.1016/J.ORL.2005.12.005MaRDI QIDQ2643814zbMATH OpenOpenAlexFDO

Authors J. P. 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 planeslattice basesmixed-integer linear programmingsplit closuresplit cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 2086918
• Split closure and intersection cuts
• On some generalizations of the split closure
• Characterization of the split closure via geometric lifting
• On the polyhedrality of cross and quadrilateral closures

Cites work

• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Chvátal closures for mixed integer programming problems
• Cutting planes from a mixed integer Farkas lemma.
• Disjunctive programming: Properties of the convex hull of feasible points
• scientific article; zbMATH DE number 2086918 (Why is no real title available?)
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• On the separation of split cuts and related inequalities
• Split closure and intersection cuts

Cited in

(13)

• Split cuts and extended formulations for mixed integer conic quadratic programming
• The split closure of a strictly convex body
• Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
• On the polyhedrality of cross and quadrilateral closures
• On some generalizations of the split closure
• Relaxations of mixed integer sets from lattice-free polyhedra
• Relaxations of mixed integer sets from lattice-free polyhedra
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• A note on the split rank of intersection cuts
• The k-aggregation closure for covering sets
• MIR closures of polyhedral sets
• Chvátal closures for mixed integer programming problems
• Equivalence between intersection cuts and the corner polyhedron

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643814)