On the complexity of cutting plane proofs using split cuts.
Sanjeeb Dash · Electronic colloquium on computational complexity · 2008
We prove a monotone interpolation property for split cuts which, together with results from Pudlak (1997) [20], implies that cutting-plane proofs which use split cuts (or, equivalently, mixed-integer rounding cuts or Gomory mixed-integer cuts) have exponential length in the worst case.