Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem.
Ali AouadDanny SegevPublished in: Oper. Res. (2023)
Keyphrases
- knapsack problem
- approximate dynamic programming
- dynamic programming
- linear program
- optimal solution
- combinatorial optimization problems
- stochastic dynamic programming
- optimization problems
- exact algorithms
- reinforcement learning
- np hard
- linear programming relaxation
- multidimensional knapsack problem
- multistage
- linear programming
- greedy algorithm
- step size
- optimal control
- implicit enumeration
- average cost
- continuous relaxation
- state space
- randomly generated test instances
- maximum profit
- neural network
- greedy heuristic
- markov decision processes
- optimal policy
- evolutionary algorithm
- bayesian networks