A Probabilistic Analysis of the Strength of the Split and Triangle Closures

DOI10.1007/978-3-642-20807-2_3zbMath1298.90055OpenAlexW72849363MaRDI QIDQ3009748

Cornuéjols, Gérard, Marco Molinaro, Amitabh Basu

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_3

zbMATH Keywords

relative strength of split cuts and triangle cutsRelaxed Corner Polyhedron (RCP)

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Theoretical challenges towards cutting-plane selection, Approximating polyhedra with sparse inequalities, 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, The strength of multi-row models, On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs

Cites Work

• On the relative strength of split, triangle and quadrilateral cuts
• Computing with multi-row gomory cuts
• On the facets of mixed integer programs with two integer variables and two constraints
• Optimizing over the split closure
• Some polyhedra related to combinatorial problems
• Experiments with Two-Row Cuts from Degenerate Tableaux
• Minimal Valid Inequalities for Integer Constraints
• Experiments with Two Row Tableau Cuts
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming