An algorithm for the solution of the 0-1 knapsack problem.
Didier FayardGérard PlateauPublished in: Computing (1982)
Keyphrases
- knapsack problem
- optimal solution
- dynamic programming
- implicit enumeration
- greedy heuristic
- learning algorithm
- np hard
- cost function
- optimization algorithm
- computational complexity
- exact algorithms
- optimization problems
- mathematical model
- heuristic methods
- cutting plane
- simulated annealing
- np hard problems
- combinatorial optimization
- greedy algorithm
- test problems
- exact solution
- worst case