Rounding Sum-of-Squares Relaxations.
Boaz BarakJonathan A. KelnerDavid SteurerPublished in: Electron. Colloquium Comput. Complex. (2013)
Keyphrases
- linear programming relaxation
- linear programming
- lower bound
- approximation algorithms
- knapsack problem
- np hard
- mixed integer
- semidefinite
- column generation
- feasible solution
- tight upper and lower bounds
- linear program
- integer programming
- branch and bound
- integer program
- convex relaxation
- mixed integer programming
- objective function
- upper bound
- primal dual
- hidden markov models
- interior point methods
- search engine
- data sets