On the gap between the quadratic integer programming problem and its semidefinite relaxation.
U. MalikImad M. JaimoukhaG. D. HalikiasS. K. GungahPublished in: Math. Program. (2006)
Keyphrases
- semidefinite
- integer programming
- semidefinite programming
- linear programming
- convex relaxation
- np hard
- lagrangian relaxation
- interior point methods
- higher dimensional
- constraint programming
- cutting plane
- column generation
- sufficient conditions
- integer program
- valid inequalities
- convex sets
- cutting plane algorithm
- primal dual
- lp relaxation