On the two-dimensional Knapsack Problem.
Alberto CapraraMichele MonaciPublished in: Oper. Res. Lett. (2004)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- three dimensional
- optimization problems
- test problems
- optimal solution
- exact algorithms
- np hard
- linear programming relaxation
- bicriteria
- np hard problems
- greedy algorithm
- heuristic solution
- greedy heuristic
- multidimensional knapsack problem
- multiple objectives
- continuous relaxation
- maximum profit
- cutting plane
- implicit enumeration