A column generation method for the multiple-choice multi-dimensional knapsack problem.
N. CherfiMhand HifiPublished in: Comput. Optim. Appl. (2010)
Keyphrases
- generation method
- knapsack problem
- multiple choice
- multi dimensional
- multidimensional knapsack problem
- open ended
- combinatorial optimization problems
- dynamic programming
- optimization problems
- optimal solution
- np hard
- exact algorithms
- greedy algorithm
- lower bound
- maximum profit
- special case
- e learning
- exam questions
- randomly generated test instances