On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts

DOI10.1007/S10107-015-0975-1MaRDI QIDQ344930zbMATHOpenAlexFDO

Authors E. Balas, Tamás Kis

Publication date 25 November 2016

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

Full work available at URL http://real.mtak.hu/42010/7/EBalas%20-%20TKis%20On%20the%20relationship%20%20%20latex%2012%2011%2015-tks.pdf

zbMATH Keywords

integer programmingcorner polyhedrageneralized intersection cutsintersection cutslift-and-project cuts

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1757966
• scientific article; zbMATH DE number 2086918
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
• Split closure and intersection cuts
• Reformulating the disjunctive cut generating linear program

Cites work

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3550465 (Why is no real title available?)
• scientific article; zbMATH DE number 4119933 (Why is no real title available?)
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Constrained infinite group relaxations of MIPs
• Disjunctive programming and relaxations of polyhedra
• Disjunctive programming: Properties of the convex hull of feasible points
• Equivalence between intersection cuts and the corner polyhedron
• Generalized intersection cuts and a new cut generating paradigm
• Inequalities from Two Rows of a Simplex Tableau
• Integer programming and convex analysis: Intersection cuts from outer polars
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Intersection cuts -- standard versus restricted
• Intersection cuts from multiple rows: a disjunctive programming approach
• Lift-and-project for general two-term disjunctions
• Some polyhedra related to combinatorial problems
• Split closure and intersection cuts

Cited in

(6)

• Reformulating the disjunctive cut generating linear program
• Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
• Intersection cuts -- standard versus restricted
• On the rank of disjunctive cuts
• When Lift-and-Project Cuts Are Different
• Generalized intersection cuts and a new cut generating paradigm

This page was built for publication: On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts

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