On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
DOI10.1007/S10107-015-0975-1zbMATH Open1370.90152OpenAlexW2233097166MaRDI QIDQ344930FDOQ344930
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
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
integer programmingcorner polyhedrageneralized intersection cutsintersection cutslift-and-project cuts
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Some polyhedra related to combinatorial problems
- Constrained infinite group relaxations of MIPs
- Title not available (Why is that?)
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Title not available (Why is that?)
- Split closure and intersection cuts
- 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
- Generalized intersection cuts and a new cut generating paradigm
- Lift-and-project for general two-term disjunctions
- Disjunctive programming and relaxations of polyhedra
- Intersection cuts from multiple rows: a disjunctive programming approach
- Title not available (Why is that?)
- Integer programming and convex analysis: Intersection cuts from outer polars
- Equivalence between intersection cuts and the corner polyhedron
Cited In (6)
- Reformulating the disjunctive cut generating linear program
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- On the rank of disjunctive cuts
- When Lift-and-Project Cuts Are Different
- Intersection cuts -- standard versus restricted
- 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)
