Matrix analysis
Theory of linear and integer programming
Theory of linear and integer programming
Clique tree inequalities and the symmetric travelling salesman problem
Mathematics of Operations Research
The monotone circuit complexity of Boolean functions
Combinatorica
On the complexity of cutting-plane proofs
Discrete Applied Mathematics
Many hard examples for resolution
Journal of the ACM (JACM)
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)
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Proceedings of the first Malta conference on Graphs and combinatorics
Lower bounds to the size of constant-depth propositional proofs
Journal of Symbolic Logic
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework
Management Science
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
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Mathematics of Operations Research
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Matrix-Cut Rank of Polyhedra
Mathematics of Operations Research
Operations Research Letters
Elementary closures for integer programs
Operations Research Letters
Twelve problems in proof complexity
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Improving integrality gaps via Chvátal-Gomory rounding
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Scheduling of scientific workflow in non-dedicated heterogeneous multicluster platform
Journal of Systems and Software
| Hi-index | 0.00 |
Branch-and-cut methods are among the more successful techniques for solving integer programming problems. They can also be used to prove that all solutions of an integer program satisfy a given linear inequality. We examine the complexity of branch-and-cut proofs in the context of 0-1 integer programs. We prove an exponential lower bound on the length of branch-and-cut proofs in the case where branching is on the variables and the cutting planes used are lift-and-project cuts (also 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.