Pages that link to "Item:Q924879"
From MaRDI portal
The following pages link to Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879):
Displaying 5 items.
- Yet harder knapsack problems (Q653327) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← 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)
- Tight bounds for blind search on the integers (Q4910723) (← links)