Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations.
Franz RendlGiovanni RinaldiAngelika WiegelePublished in: Math. Program. (2010)
Keyphrases
- semidefinite
- max cut
- np complete problems
- convex sets
- semidefinite programming
- np complete
- convex relaxation
- sufficient conditions
- higher dimensional
- interior point methods
- graph coloring
- optimal solution
- phase transition
- quadratic programming
- np hard
- finite number
- graph model
- linear programming
- lower bound
- globally optimal
- convex optimization
- vector space
- maximum likelihood
- pairwise
- image processing