Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lov[a-acute]sz--Schrijver Lift-and-Project Procedure.
Monique LaurentPublished in: SIAM J. Optim. (2002)
Keyphrases
- semidefinite
- max cut
- semidefinite programming
- convex relaxation
- sufficient conditions
- higher dimensional
- convex sets
- graph model
- upper bound
- interior point methods
- planar graphs
- image processing
- linear programming
- finite dimensional
- multistage
- dynamic programming
- np hard
- linear programming relaxation
- bayesian networks