A new enumeration scheme for the knapsack problem.
Horacio Hideki YanasseNei Yoshihiro SomaPublished in: Discret. Appl. Math. (1987)
Keyphrases
- knapsack problem
- dynamic programming
- test problems
- optimal solution
- exact algorithms
- combinatorial optimization problems
- optimization problems
- np hard
- greedy heuristic
- heuristic solution
- multidimensional knapsack problem
- np hard problems
- greedy algorithm
- continuous relaxation
- bicriteria
- maximum profit
- multiple objectives
- decision variables
- search space
- cutting plane
- approximation algorithms
- traveling salesman problem
- lower bound