On the complexity of cutting-plane proofs using split cuts

Sanjeeb Dash. On the complexity of cutting-plane proofs using split cuts. Oper. Res. Lett., 38(2):109-114, 2010. [doi]

Abstract

Abstract is missing.