Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack.
Anna R. KarlinClaire MathieuC. Thach NguyenPublished in: IPCO (2011)
Keyphrases
- semidefinite
- semi definite programming
- lp relaxation
- knapsack problem
- semidefinite programming
- linear systems
- convex relaxation
- feasible solution
- linear programming
- sufficient conditions
- optimal solution
- dynamic programming
- linear programming relaxation
- interior point methods
- convex optimization
- integer programming
- higher dimensional
- machine learning
- upper bound
- np hard
- convex sets
- kernel matrix
- pairwise constraints
- multistage
- lower bound
- learning algorithm