Pages that link to "Item:Q5704244"
From MaRDI portal
The following pages link to Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs (Q5704244):
Displaying 10 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
