Computational experience with a core-based reduction procedure for the 2-knapsack problem.
Federico Della CroceAndrea GrossoPublished in: Comput. Oper. Res. (2011)
Keyphrases
- knapsack problem
- cutting plane
- optimal solution
- combinatorial optimization problems
- optimization problems
- test problems
- dynamic programming
- exact algorithms
- multidimensional knapsack problem
- np hard
- bicriteria
- linear programming relaxation
- np hard problems
- greedy algorithm
- multiple objectives
- continuous relaxation
- decision variables
- greedy heuristic
- heuristic solution
- implicit enumeration