Rounding Sum-of-Squares Relaxations.
Boaz BarakJonathan A. KelnerDavid SteurerPublished in: CoRR (2013)
Keyphrases
- linear programming relaxation
- linear programming
- lower bound
- approximation algorithms
- knapsack problem
- column generation
- linear program
- feasible solution
- np hard
- integer programming
- mixed integer
- semidefinite
- objective function
- branch and bound
- tight upper and lower bounds
- convex relaxation
- worst case
- upper bound
- dynamic programming
- special case
- semidefinite programming
- mixed integer programming
- neural network
- databases
- integer program
- optimal solution
- image processing
- information systems