On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension.
Fernando Mário de Oliveira FilhoFrank VallentinPublished in: CoRR (2018)
Keyphrases
- integrality gap
- semidefinite programming
- primal dual
- linear programming
- linear programming relaxation
- linear program
- valid inequalities
- lp relaxation
- interior point methods
- tight upper and lower bounds
- approximation algorithms
- semidefinite
- convex optimization
- arbitrarily close
- lower bound
- convergence rate
- column generation
- knapsack problem
- feasible solution
- kernel matrix
- integer programming
- np hard
- optimal solution
- semi definite programming
- branch and bound
- dynamic programming
- lagrangian relaxation
- objective function
- optimization problems