An Improved Convex 0-1 quadratic Program Reformulation for Chance-Constrained quadratic Knapsack Problems.
Shuhui JiXiaojin ZhengXiaoling SunPublished in: Asia Pac. J. Oper. Res. (2013)
Keyphrases
- knapsack problem
- chance constrained
- convex quadratic
- combinatorial optimization problems
- optimization problems
- inequality constraints
- dynamic programming
- optimal solution
- np hard
- test problems
- objective function
- greedy algorithm
- exact algorithms
- stochastic programming
- multistage
- computational complexity
- interior point methods