An approximate dynamic programming approach to convex quadratic knapsack problems.
Zhongsheng HuaBin ZhangLiang LiangPublished in: Comput. Oper. Res. (2006)
Keyphrases
- approximate dynamic programming
- knapsack problem
- convex quadratic
- dynamic programming
- inequality constraints
- linear program
- combinatorial optimization problems
- optimal solution
- np hard
- interior point methods
- exact algorithms
- optimization problems
- reinforcement learning
- nonlinear programming
- greedy algorithm
- linear programming
- step size
- state space
- infinite horizon
- control policy
- nsga ii
- finite number
- average cost
- multistage
- genetic algorithm