Intersection cuts from multiple rows: a disjunctive programming approach
From MaRDI portal
Publication:458123
DOI10.1007/s13675-013-0008-xzbMath1296.90080arXiv1206.1630OpenAlexW2037710606MaRDI QIDQ458123
Publication date: 30 September 2014
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.1630
Related Items
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, When Lift-and-Project Cuts Are Different
Uses Software
Cites Work
- On the relative strength of split, triangle and quadrilateral cuts
- Testing cut generators for mixed-integer linear programming
- Chvátal closures for mixed integer programming problems
- Equivalence between intersection cuts and the corner polyhedron
- Strengthening cuts for mixed integer programs
- 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
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the facets of mixed integer programs with two integer variables and two constraints
- Some polyhedra related to combinatorial problems
- Two row mixed-integer cuts via lifting
- Experiments with Two-Row Cuts from Degenerate Tableaux
- Minimal Valid Inequalities for Integer Constraints
- Experiments with Two Row Tableau Cuts
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
