EIA-CNDP: an exact iterative algorithm for critical node detection problem
type: Item
instance of: scholarly article
title: EIA-CNDP: an exact iterative algorithm for critical node detection problem
author: Javad Rezaei
author: Fatemeh Zare-Mirakabad
author: S. A. MirHassani
author: Sayed-Amir Marashi
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350533
zbMATH Keywords: exact algorithm
zbMATH Keywords: critical node
zbMATH Keywords: largest connected component
zbMATH Keywords: mixed integer linear programming
zbMATH Keywords: network vulnerability
describes a project that uses: SparseMatrix
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105138
OpenAlex ID: W3108009706
cites work: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
cites work: Hybrid constructive heuristics for the critical node problem
cites work: VNS solutions for the critical node problem
cites work: A genetic algorithm for a class of critical node problems
cites work: Detecting critical nodes in sparse graphs
cites work: Cardinality-Constrained Critical Node Detection Problem
cites work: Identifying sets of key players in a social network
cites work: The university of Florida sparse matrix collection
cites work: Bound and exact methods for assessing link vulnerability in complex networks
cites work: Complexity of the critical node problem over trees
cites work: Branch and cut algorithms for detecting critical nodes in undirected graphs
cites work: Variable neighbourhood search: methods and applications
cites work: A cutting-plane algorithm for solving a weighted influence interdiction problem
cites work: Optimal detection of critical nodes: improvements to model structure and performance
cites work: A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
cites work: Component-cardinality-constrained critical node problem in graphs
cites work: The critical node detection problem in networks: a survey
cites work: Methods for removing links in a network to minimize the spread of infections
cites work: Robust critical node selection by Benders decomposition
cites work: Disconnecting graphs by removing vertices: a polyhedral approach
cites work: Computing Critical Nodes in Directed Graphs
cites work: Improved formulations for minimum connectivity network interdiction problems
cites work: Compact models for critical node detection in telecommunication networks
cites work: Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions
cites work: Tabu search enhances network robustness under targeted attacks
cites work: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
cites work: A randomized algorithm with local search for containment of pandemic disease spread
cites work: A derandomized approximation algorithm for the critical node detection problem
cites work: A Region Growing Algorithm for Detecting Critical Nodes
cites work: A Fast Greedy Algorithm for the Critical Node Detection Problem
cites work: The bi-objective critical node detection problem
cites work: An integer programming framework for critical elements detection in graphs
cites work: Exact identification of critical nodes in sparse networks via new compact formulations
cites work: Selected Topics in Critical Element Detection
cites work: Discovering the influential users oriented to viral marketing based on online social networks
DOI: 10.1016/J.COR.2020.105138
description: scientific article; zbMATH DE number 7350533