A note on semidefinite relaxation for 0-1 quadratic knapsack problems.
Xiaojin ZhengXiaoling SunDuan LiPublished in: Optim. Methods Softw. (2013)
Keyphrases
- semidefinite
- knapsack problem
- linear programming relaxation
- semidefinite programming
- convex relaxation
- optimal solution
- optimization problems
- dynamic programming
- sufficient conditions
- higher dimensional
- np hard
- greedy algorithm
- interior point methods
- convex optimization
- convex sets
- linear programming
- multistage
- optimization methods
- globally optimal
- cutting plane
- pairwise
- objective function