A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations.
Franz RendlGiovanni RinaldiAngelika WiegelePublished in: IPCO (2007)
Keyphrases
- semidefinite
- branch and bound algorithm
- convex sets
- lower bound
- branch and bound
- semidefinite programming
- np hard
- upper bound
- optimal solution
- convex relaxation
- combinatorial optimization
- higher dimensional
- interior point methods
- sufficient conditions
- linear programming
- linear program
- search algorithm
- finite number
- convex hull
- approximation algorithms
- convex optimization
- max sat
- worst case
- optimization algorithm