Exact and approximate algorithms for discounted {0-1} knapsack problem.
Yi-Chao HeXi-Zhao WangYu-Lin HeShuliang ZhaoWen-Bin LiPublished in: Inf. Sci. (2016)
Keyphrases
- exact and approximate
- knapsack problem
- exact algorithms
- combinatorial optimization problems
- dynamic programming
- optimization problems
- np hard problems
- data structure
- multidimensional knapsack problem
- combinatorial optimization
- greedy heuristic
- approximation algorithms
- data sets
- computational complexity
- exact solution
- worst case
- upper bound
- optimal solution
- neural network