A Polynomial-Time Algorithm for Knapsack with Divisible Item Sizes.
Wim F. J. VerhaeghEmile H. L. AartsPublished in: Inf. Process. Lett. (1997)
Keyphrases
- computational cost
- computational complexity
- special case
- experimental evaluation
- times faster
- theoretical analysis
- dynamic programming
- np hardness
- neural network
- filtering algorithm
- approximation algorithms
- clustering method
- input data
- high accuracy
- worst case
- cost function
- significant improvement
- recommender systems
- preprocessing
- optimal solution
- bayesian networks
- decision trees