On the relative strength of split, triangle and quadrilateral cuts

MaRDI QIDQ4633937zbMATH OpenFDO

Authors Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496902

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On the relative strength of split, triangle and quadrilateral cuts
• A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
• On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
• Split rank of triangle and quadrilateral inequalities
• A probabilistic analysis of the strength of the split and triangle closures

Cited in

(10)

• Stable sets, corner polyhedra and the Chvàtal closure
• The strength of multi-row aggregation cuts for sign-pattern integer programs
• On the separation of split inequalities for non-convex quadratic integer programming
• On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
• An algorithm for the separation of two-row cuts
• Split rank of triangle and quadrilateral inequalities
• A probabilistic analysis of the strength of the split and triangle closures
• A probabilistic comparison of split and type 1 triangle cuts for two-row mixed-integer programs
• A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
• On the relative strength of split, triangle and quadrilateral cuts

This page was built for publication: On the relative strength of split, triangle and quadrilateral cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633937)