Pages that link to "Item:Q6115357"
From MaRDI portal
The following pages link to On the power and limitations of branch and cut (Q6115357):
Displaying 7 items.
- 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)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- On polytopes with linear rank with respect to generalizations of the split closure (Q6122082) (← links)
- Depth lower bounds in Stabbing Planes for combinatorial principles (Q6137876) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)