Theory of linear and integer programming
Theory of linear and integer programming
The monotone circuit complexity of Boolean functions
Combinatorica
Cutting-plane proofs in polynomial space
Mathematical Programming: Series A and B
A hierarchy of relaxation between the continuous and convex hull representations
SIAM Journal on Discrete Mathematics
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Combinatorial optimization
An exponential lower bound for the size of monotone real circuits
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
On the matrix-cut rank of polyhedra: 19
Mathematics of Operations Research
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Mathematics of Operations Research
SIAM Journal on Optimization
MIP: Theory and Practice - Closing the Gap
Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization: Methods, Theory and Applications
Complexity of Semi-algebraic Proofs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
INFORMS Journal on Computing
Aggregation and Mixed Integer Rounding to Solve MIPs
Operations Research
Cutting planes and the complexity of the integer hull
Cutting planes and the complexity of the integer hull
Operations Research Letters
On the rank of cutting-plane proof systems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On the complexity of cutting-plane proofs using split cuts
Operations Research Letters
Scheduling of scientific workflow in non-dedicated heterogeneous multicluster platform
Journal of Systems and Software
| Hi-index | 0.00 |
We examine the complexity of branch-and-cut proofs in the context of 0-1 integer programs. We establish an exponential lower bound on the length of branch-and-cut proofs that use 0-1 branching and lift-and-project cuts (called simple disjunctive cuts by some authors), Gomory-Chvátal cuts, and cuts arising from the N0 matrix-cut operator of Lovász and Schrijver. A consequence of the lower-bound result in this paper is that branch-and-cut methods of the type described above have exponential running time in the worst case.