Max-Cut is one of the most studied combinatorial optimization problems because of its wide range of applications and because of its connections with other fields of discrete mathematics. The paper surveys the most recent methods based on SDP reformulation fo Max_cut with some emphasis on their impact on the computation of heuristic and exact solutions
Palagi, L., Piccialli, V., Rendl, F., Rinaldi, G., Wiegele, A. (2012). Computational approaches to Max-cut. In M. Anjos, J. Lasserre (a cura di), Handbook on semidefinite, conic and polynomial optimization (pp. 821-847). Springer US [10.1007/978-1-4614-0769-0_28].
Computational approaches to Max-cut
PICCIALLI, VERONICA;
2012-01-01
Abstract
Max-Cut is one of the most studied combinatorial optimization problems because of its wide range of applications and because of its connections with other fields of discrete mathematics. The paper surveys the most recent methods based on SDP reformulation fo Max_cut with some emphasis on their impact on the computation of heuristic and exact solutionsFile in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
MPSPeeDPvolume.pdf
solo utenti autorizzati
Licenza:
Copyright dell'editore
Dimensione
578.39 kB
Formato
Adobe PDF
|
578.39 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
