A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs

DOI10.1137/100797254zbMath1230.90138OpenAlexW2031456204MaRDI QIDQ3105768

Shabbir Ahmed, Qie He, Nemhauser, George I.

Publication date: 9 January 2012

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100797254

zbMATH Keywords

mixed integer programssplit cutsprobabilistic comparisontriangle cuts

Mathematics Subject Classification ID

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

Related Items (4)

Theoretical challenges towards cutting-plane selection ⋮ A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts ⋮ Can Cut-Generating Functions Be Good and Efficient? ⋮ On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs

This page was built for publication: A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs