The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem.
Yingjie LiuPublished in: Theory Comput. Syst. (2002)
Keyphrases
- knapsack problem
- dynamic programming
- optimal solution
- exact algorithms
- polynomial approximation
- np hard
- learning algorithm
- computational complexity
- bicriteria
- optimization problems
- cost function
- machine learning
- ant colony optimization
- test problems
- objective function
- implicit enumeration
- simulated annealing
- particle filter
- convex hull
- worst case
- approximation algorithms
- pointwise
- special case