The following pages link to (Q5092485):
Displaying 6 items.
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem (Q2083992) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Depth lower bounds in Stabbing Planes for combinatorial principles (Q6137876) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
