Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs.

Samuel Burer Renato D. C. Monteiro Yin Zhang

Published in: SIAM J. Optim. (2002)

Keyphrases

max cut
quadratic program
graph model
np hard
planar graphs
linear constraints
objective function
linear program
convex optimization
np complete problems
graph partitioning
search algorithm
approximation algorithms
mixed integer
linear programming
learning algorithm
quadratic programming
upper bound
maximum margin