| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652079 | Electronic Notes in Discrete Mathematics | 2015 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
