Dynamic programming based algorithms for the discounted {0-1} knapsack problem.
Aiying RongJosé Rui FigueiraKathrin KlamrothPublished in: Appl. Math. Comput. (2012)
Keyphrases
- knapsack problem
- dynamic programming
- exact algorithms
- combinatorial optimization problems
- test problems
- optimization problems
- np hard problems
- greedy heuristic
- greedy algorithm
- markov decision processes
- learning algorithm
- np hard
- combinatorial optimization
- benchmark problems
- machine learning
- linear program
- optimal control
- optimal policy
- state space
- evolutionary algorithm
- computational complexity
- bayesian networks
- multidimensional knapsack problem
- randomly generated test instances