On an Analysis of the Strength of Mixed-Integer Cutting Planes from Multiple Simplex Tableau Rows

DOI10.1137/080744360zbMath1201.90137OpenAlexW1984943604MaRDI QIDQ3563917

Robert Weismantel, Kent Andersen, Christian Wagner

Publication date: 1 June 2010

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

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

zbMATH Keywords

cutting planemixed-integerlattice-free polyhedra

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts, An algorithm for the separation of two-row cuts, Can Cut-Generating Functions Be Good and Efficient?, Approximation of Corner Polyhedra with Families of Intersection Cuts, On the relative strength of different generalizations of split cuts, Stable sets, corner polyhedra and the Chvàtal closure, Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case