We consider the Critical Node Problem: given an undirected graph and an integer number K, at most K nodes have to be deleted from the graph in order to minimize a connectivity measure in the residual graph. We combine the basic steps used in common greedy algorithms with some flavour of local search, in order to obtain simple hybrid heuristic algorithms. The obtained algorithms are shown to be effective, delivering improved performances (solution quality and speed) with respect to known greedy algorithms and other more sophisticated state of the art methods.

Hybrid constructive heuristics for the critical node problem

ARINGHIERI, ROBERTO;GROSSO, Andrea Cesare;HOSTEINS, Pierre
2016

Abstract

We consider the Critical Node Problem: given an undirected graph and an integer number K, at most K nodes have to be deleted from the graph in order to minimize a connectivity measure in the residual graph. We combine the basic steps used in common greedy algorithms with some flavour of local search, in order to obtain simple hybrid heuristic algorithms. The obtained algorithms are shown to be effective, delivering improved performances (solution quality and speed) with respect to known greedy algorithms and other more sophisticated state of the art methods.
637
649
http://link.springer.com/article/10.1007%2Fs10479-016-2110-y
Addis, Bernardetta; Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre
File in questo prodotto:
File Dimensione Formato  
2016-CNP-ANOR-published.pdf

Accesso riservato

Descrizione: PDF editoriale
Tipo di file: PDF EDITORIALE
Dimensione 553.82 kB
Formato Adobe PDF
553.82 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
2016-CNP-ANOR-PostPrint.pdf

Accesso aperto con embargo fino al 13/02/2017

Descrizione: PostPrint
Tipo di file: POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione 550.18 kB
Formato Adobe PDF
550.18 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2318/1555950
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 29
  • ???jsp.display-item.citation.isi??? 21
social impact