David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Paper
On the complexity of cutting-plane proofs using split cuts
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.
Related
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control