Pages that link to "Item:Q1744347"
From MaRDI portal
The following pages link to On the best choice of a branching variable in the subset sum problem (Q1744347):
Displayed 3 items.
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Optimal strategy for solving a special case of the knapsack problem by the branch and bound method (Q2666932) (← links)