On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs

DOI10.1137/080735473zbMath1198.90300OpenAlexW2035360805MaRDI QIDQ3563923

Sanjeeb Dash, Oktay Günlük

Publication date: 1 June 2010

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

Full work available at URL: https://semanticscholar.org/paper/92c9408c27f139c0aa5c49ddef0ca3524d6c152d

zbMATH Keywords

mixed integer programmingcutting plane proofs

Mathematics Subject Classification ID

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

Related Items (6)

Theoretical challenges towards cutting-plane selection ⋮ Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ Composite lifting of group inequalities and an application to two-row mixing inequalities ⋮ Nonunique Lifting of Integer Variables in Minimal Inequalities ⋮ A note on the split rank of intersection cuts ⋮ Cutting planes from extended LP formulations

This page was built for publication: On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs