A genetic algorithm for a class of critical node problems

DOI10.1016/j.endm.2016.03.047zbMath1351.90037OpenAlexW2395843226MaRDI QIDQ325485

Roberto Aringhieri, Andrea Grosso, Pierre Hosteins

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.047

zbMATH Keywords

genetic algorithmcritical node problemgraph fragmentationcardinality-constrained

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (5)

Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem ⋮ The stochastic critical node problem over trees ⋮ A compact mixed integer linear formulation for safe set problems ⋮ A preliminary analysis of the distance based critical node problem ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem

Cites Work

• Identifying sets of key players in a social network
• Hybrid constructive heuristics for the critical node problem
• A derandomized approximation algorithm for the critical node detection problem
• Detecting critical nodes in sparse graphs
• 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
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• VNS solutions for the critical node problem
• Cardinality-Constrained Critical Node Detection Problem
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
• Removing Arcs from a Network

This page was built for publication: A genetic algorithm for a class of critical node problems