Pages that link to "Item:Q5084602"
From MaRDI portal
The following pages link to Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602):
Displaying 8 items.
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem (Q2083992) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- An abstract model for branch-and-cut (Q2164714) (← links)
- The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem (Q3354470) (← links)
- A study of lattice reformulations for integer programming (Q6047692) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)
- An abstract model for branch and cut (Q6589748) (← links)