Publication
Operations Research Letters
Paper

On the complexity of cutting-plane proofs using split cuts

View publication

Abstract

We prove a monotone interpolation property for split cuts which, together with results from Pudlák (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. © 2009 Elsevier B.V.

Date

01 Mar 2010

Publication

Operations Research Letters

Authors

Topics

Share