An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem.
Thomas C. PerryJoseph C. HartmanPublished in: Int. Trans. Oper. Res. (2009)
Keyphrases
- knapsack problem
- approximate dynamic programming
- stochastic dynamic programming
- dynamic programming
- implicit enumeration
- linear program
- combinatorial optimization problems
- randomly generated test instances
- optimization problems
- optimal solution
- multidimensional knapsack problem
- lp relaxation
- linear programming
- np hard
- exact algorithms
- step size
- monte carlo
- dna computing
- mathematical model
- maximum profit