The following pages link to (Q3865832):
Displaying 4 items.
- A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766) (← links)
- Implementation and analysis of a variant of the dual method for the capacitated transshipment problem (Q1143947) (← links)
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints (Q3312019) (← links)