We present a VNS algorithm for the Critical Node Problem, i.e., the maximal fragmentation of a graph through the deletion of k nodes. Two computational efficient neighbourhoods are proposed proving also their equivalence to the straightforward exchange of two nodes. The results of the proposed VNS algorithms outperform those currently available in literature.
VNS solutions for the critical node problem
ARINGHIERI, ROBERTO;GROSSO, Andrea Cesare;HOSTEINS, Pierre;
2015-01-01
Abstract
We present a VNS algorithm for the Critical Node Problem, i.e., the maximal fragmentation of a graph through the deletion of k nodes. Two computational efficient neighbourhoods are proposed proving also their equivalence to the straightforward exchange of two nodes. The results of the proposed VNS algorithms outperform those currently available in literature.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2015-ENDM-VNS-CNP.pdf
Accesso riservato
Tipo di file:
PDF EDITORIALE
Dimensione
204.9 kB
Formato
Adobe PDF
|
204.9 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
2015-ENDM-VNS-CNP-PostPrint.pdf
Open Access dal 21/02/2017
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
444.5 kB
Formato
Adobe PDF
|
444.5 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
