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.
Computational Approaches to Max-Cut / Palagi, Laura; Piccialli, Veronica; Franz, Rendl; Giovanni, Rinaldi; Angelika, Wiegele. - STAMPA. - 166(2012), pp. 821-847. - INTERNATIONAL SERIES IN OPERATIONS RESEARCH & MANAGEMENT SCIENCE. [10.1007/978-1-4614-0769-0_28].
Computational Approaches to Max-Cut
PALAGI, Laura;PICCIALLI, Veronica;
2012
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 solutions.File allegati a questo prodotto
| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2012_11573-407154.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
281.19 kB
Formato
Adobe PDF
|
281.19 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
