Split Rank of Triangle and Quadrilateral Inequalities

DOI10.1287/moor.1110.0496zbMath1242.90127arXiv0906.0887OpenAlexW2157487045MaRDI QIDQ2884282

Quentin Louveaux, Santanu S. Dey

Publication date: 24 May 2012

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.0887

zbMATH Keywords

mixed-integer programmingsplit rankmulti-row cutting planes

Mathematics Subject Classification ID

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

Related Items

Binary extended formulations of polyhedral mixed-integer sets ⋮ Theoretical challenges towards cutting-plane selection ⋮ An algorithm for the separation of two-row cuts ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs ⋮ The triangle closure is a polyhedron ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ The (not so) trivial lifting in two dimensions ⋮ The strength of multi-row models