A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables.
Daniel S. HirschbergC. K. WongPublished in: J. ACM (1976)
Keyphrases
- knapsack problem
- optimal solution
- learning algorithm
- np hard
- worst case
- computational complexity
- test problems
- cost function
- dynamic programming
- objective function
- optimization algorithm
- implicit enumeration
- combinatorial optimization
- linear programming
- special case
- search space
- optimization problems
- particle swarm optimization
- simulated annealing
- convex hull
- evolutionary algorithm
- approximation algorithms
- exact algorithms
- bicriteria
- neural network