A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
From MaRDI portal
Publication:433114
DOI10.1016/j.orl.2011.04.005zbMath1242.90126arXiv1009.5253OpenAlexW1993493269WikidataQ57568139 ScholiaQ57568139MaRDI QIDQ433114
Alberto Del Pia, Christian Wagner, Robert Weismantel
Publication date: 13 July 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.5253
Related Items
Theoretical challenges towards cutting-plane selection, Can Cut-Generating Functions Be Good and Efficient?, Relaxations of mixed integer sets from lattice-free polyhedra, Relaxations of mixed integer sets from lattice-free polyhedra, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow
Cites Work
- Unnamed Item
- On the relative strength of split, triangle and quadrilateral cuts
- Inequalities for the lattice width of lattice-free convex sets in the plane
- Blowing up convex sets in the plane
- Chvátal closures for mixed integer programming problems
- Worst-case comparison of valid inequalities for the TSP
- Optimizing over the split closure
- Two row mixed-integer cuts via lifting
- A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs
- On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows
- Zero-Coefficient Cuts
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
