Pages that link to "Item:Q969718"
From MaRDI portal
The following pages link to A column generation method for the multiple-choice multi-dimensional knapsack problem (Q969718):
Displaying 10 items.
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← 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 Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem (Q5148190) (← links)