VNS solutions for the critical node problem
From MaRDI portal
Publication:2631225
DOI10.1016/j.endm.2014.11.006zbMath1362.68255MaRDI QIDQ2631225
Andrea Grosso, Roberto Aringhieri, Pierre Hosteins, Rosario Scatamacchia
Publication date: 29 July 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.006
68R10: Graph theory (including graph drawing) in computer science
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Hybrid constructive heuristics for the critical node problem, A genetic algorithm for a class of critical node problems
Cites Work
- Identifying sets of key players in a social network
- Complexity of the critical node problem over trees
- Variable neighbourhood search: methods and applications
- Detecting critical nodes in sparse graphs
- Variable neighbourhood search: Methods and applications
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Deterministic network interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Removing Arcs from a Network