LP based heuristics for the multiple knapsack problem with assignment restrictions.
Geir DahlNjål FoldnesPublished in: Ann. Oper. Res. (2006)
Keyphrases
- knapsack problem
- exact algorithms
- optimal solution
- greedy heuristic
- combinatorial optimization problems
- np hard
- heuristic solution
- linear programming relaxation
- dynamic programming
- test problems
- optimization problems
- multidimensional knapsack problem
- randomly generated test instances
- greedy algorithm
- lp relaxation
- np hard problems
- continuous relaxation
- linear programming
- cutting plane
- heuristic methods
- column generation
- decision variables