Charles A Micchelli
Journal of Approximation Theory
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
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Conference paper
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990