Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2086919
- On the complexity of cutting-plane proofs using split cuts
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
Cited in
(14)- Theoretical challenges towards cutting-plane selection
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Lower bounds on the size of general branch-and-bound trees
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- Towards NP-P via proof complexity and search
- Cutting planes cannot approximate some integer programs
- scientific article; zbMATH DE number 2086919 (Why is no real title available?)
- Lifting lower bounds for tree-like proofs
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
- The Complexity of Propositional Proofs
- Complexity of optimizing over the integers
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Branch-and-bound algorithms as polynomial-time approximation schemes
- On the complexity of cutting-plane proofs using split cuts
This page was built for publication: Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704244)
