Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
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
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ