On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
From MaRDI portal
Publication:344930
DOI10.1007/s10107-015-0975-1zbMath1370.90152OpenAlexW2233097166MaRDI QIDQ344930
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
integer programmingintersection cutscorner polyhedrageneralized intersection cutslift-and-project cuts
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, When Lift-and-Project Cuts Are Different
Cites Work
- Intersection cuts from multiple rows: a disjunctive programming approach
- Equivalence between intersection cuts and the corner polyhedron
- 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
- Intersection cuts -- standard versus restricted
- Split closure and intersection cuts
- Generalized intersection cuts and a new cut generating paradigm
- Lift-and-project for general two-term disjunctions
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Disjunctive programming and relaxations of polyhedra
- Some polyhedra related to combinatorial problems
- Constrained Infinite Group Relaxations of MIPs
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Integer programming and convex analysis: Intersection cuts from outer polars
- Unnamed Item
- Unnamed Item
- Unnamed Item
