EIA-CNDP: an exact iterative algorithm for critical node detection problem

DOI10.1016/j.cor.2020.105138OpenAlexW3108009706MaRDI QIDQ2027003

Fatemeh Zare-Mirakabad, Javad Rezaei, Sayed-Amir Marashi, S. A. MirHassani

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105138

zbMATH Keywords

mixed integer linear programmingexact algorithmlargest connected componentcritical nodenetwork vulnerability

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Complexity of the multilevel critical node problem ⋮ EIA-CNDP

Uses Software

• SparseMatrix

Cites Work

• Identifying sets of key players in a social network
• Hybrid constructive heuristics for the critical node problem
• Component-cardinality-constrained critical node problem in graphs
• A genetic algorithm for a class of critical node problems
• A derandomized approximation algorithm for the critical node detection problem
• A randomized algorithm with local search for containment of pandemic disease spread
• Methods for removing links in a network to minimize the spread of infections
• Bound and exact methods for assessing link vulnerability in complex networks
• An integer programming framework for critical elements detection in graphs
• Complexity of the critical node problem over trees
• Variable neighbourhood search: methods and applications
• Detecting critical nodes in sparse graphs
• Tabu search enhances network robustness under targeted attacks
• Improved formulations for minimum connectivity network interdiction problems
• Discovering the influential users oriented to viral marketing based on online social networks
• The bi-objective critical node detection problem
• Compact models for critical node detection in telecommunication networks
• The critical node detection problem in networks: a survey
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Optimal detection of critical nodes: improvements to model structure and performance
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
• A cutting-plane algorithm for solving a weighted influence interdiction problem
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Exact identification of critical nodes in sparse networks via new compact formulations
• VNS solutions for the critical node problem
• Robust Critical Node Selection by Benders Decomposition
• A Region Growing Algorithm for Detecting Critical Nodes
• A Fast Greedy Algorithm for the Critical Node Detection Problem
• The university of Florida sparse matrix collection
• Cardinality-Constrained Critical Node Detection Problem
• Computing Critical Nodes in Directed Graphs
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
• Selected Topics in Critical Element Detection
• Disconnecting graphs by removing vertices: a polyhedral approach

This page was built for publication: EIA-CNDP: an exact iterative algorithm for critical node detection problem