Improved semidefinite bounding procedure for solving Max-Cut problems to optimality.

Nathan Krislock Jérôme Malick Frédéric Roupin

Published in: Math. Program. (2014)

Keyphrases

semidefinite
np complete problems
max cut
semidefinite programming
solving problems
optimization problems
np complete
graph coloring
learning algorithm
linear programming
sufficient conditions
combinatorial optimization
higher dimensional
quadratic programming
interior point methods