Pages that link to "Item:Q297243"
From MaRDI portal
The following pages link to A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243):
Displayed 11 items.
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem (Q2242191) (← links)
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
- An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem (Q5148190) (← links)
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)