Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4651611 | Electronic Notes in Discrete Mathematics | 2016 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roberto Aringhieri, Andrea Grosso, Pierre Hosteins,