In this paper, we deal with two different variants of the Critical Node Problem, designing a flexible genetic algorithm for tackling them both. The results are compared with the best known results available in the literature.

A Genetic Algorithm for a class of Critical Node Problems

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

Abstract

In this paper, we deal with two different variants of the Critical Node Problem, designing a flexible genetic algorithm for tackling them both. The results are compared with the best known results available in the literature.
2016
INOC 2015 – 7th International Network Optimization Conference
Warsav, Poland
May 18 - 20, 2015
52
359
366
http://www.sciencedirect.com/science/article/pii/S157106531630052X
Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre
File in questo prodotto:
File Dimensione Formato  
2016-ENDM-Genetic-CNP.pdf

Accesso riservato

Descrizione: PDF editoriale
Tipo di file: PDF EDITORIALE
Dimensione 202.29 kB
Formato Adobe PDF
202.29 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
2016-ENDM-Genetic-CNP-postPrint.pdf

Open Access dal 22/05/2018

Descrizione: Post Print
Tipo di file: POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione 458.7 kB
Formato Adobe PDF
458.7 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: https://hdl.handle.net/2318/1562070
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? ND
social impact