We will review several heuristic algorithms we proposed recently to solve different versions of the Critical Node Problem (CNP), i.e. the maximal fragmentation of a graph G given a connectivity measure, that improve the solution quality greatly over existing competitors.
A review of recent heuristic algorithms for the Critical Node Problem / Addis, Bernardetta; Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre; Scatamacchia, Rosario. - (2015), pp. 226-227. (Intervento presentato al convegno AIRO 2015 tenutosi a Pisa nel 7-10 Settembre 2015).
A review of recent heuristic algorithms for the Critical Node Problem
SCATAMACCHIA, ROSARIO
2015
Abstract
We will review several heuristic algorithms we proposed recently to solve different versions of the Critical Node Problem (CNP), i.e. the maximal fragmentation of a graph G given a connectivity measure, that improve the solution quality greatly over existing competitors.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2639594
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo