The chapter describes the most successful and most recent algorithms, based on semidefinite programming, for the exact and the heuristic solution of max-cut and related problems, like max-k-cut, coloring, and quadratic ordering.
Computational Approaches to Max-Cut
Rinaldi G;
2012
Abstract
The chapter describes the most successful and most recent algorithms, based on semidefinite programming, for the exact and the heuristic solution of max-cut and related problems, like max-k-cut, coloring, and quadratic ordering.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
