An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem.
Ali AouadDanny SegevPublished in: CoRR (2020)
Keyphrases
- knapsack problem
- approximate dynamic programming
- dynamic programming
- linear program
- optimal solution
- combinatorial optimization problems
- stochastic dynamic programming
- reinforcement learning
- greedy algorithm
- multidimensional knapsack problem
- optimization problems
- step size
- exact algorithms
- np hard
- control policy
- state space
- linear programming relaxation
- randomly generated test instances
- markov decision processes
- multistage
- continuous relaxation
- linear programming
- optimal control
- machine learning
- search space
- objective function
- maximum profit