On \(t\)-branch split cuts for mixed-integer programs

DOI10.1007/s10107-012-0542-yzbMath1280.90089OpenAlexW2123104364MaRDI QIDQ378102

Sanjeeb Dash, Oktay Günlük

Publication date: 11 November 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0542-y

zbMATH Keywords

convex hull

Mathematics Subject Classification ID

Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Characterization of the split closure via geometric lifting ⋮ Theoretical challenges towards cutting-plane selection ⋮ Partial hyperplane activation for generalized intersection cuts ⋮ Lattice closures of polyhedra ⋮ On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube ⋮ On polytopes with linear rank with respect to generalizations of the split closure ⋮ Complexity of optimizing over the integers ⋮ Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs ⋮ On the relative strength of different generalizations of split cuts ⋮ Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming

Cites Work

• Chvátal closures for mixed integer programming problems
• Cook, Kannan and Schrijver's example revisited
• Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming