Optimal detection of critical nodes: improvements to model structure and performance

DOI10.1007/S11067-018-9407-0OpenAlexW2811092953MaRDI QIDQ2005802FDOQ2005802

Authors: Gokhan Karakose, Ronald G. McGarvey 

Publication date: 8 October 2020

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-018-9407-0

Recommendations

• Efficient methods for the distance-based critical node detection problem in complex networks
• Critical node detection problem for complex network in undirected weighted networks
• The bi-objective critical node detection problem
• Compact models for critical node detection in telecommunication networks
• Robust optimization of graph partitioning and critical node detection in analyzing networks
• The critical node detection problem in networks: a survey
• Detecting critical node structures on graphs: a mathematical programming approach
• Detecting critical nodes in sparse graphs

zbMATH Keywords

mixed-integer linear programmingnetwork vulnerabilitynode disruption

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• The university of Florida sparse matrix collection
• A Two-Sided Optimization for Theater Ballistic Missile Defense
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Strategic network restoration
• Detecting critical nodes in sparse graphs
• 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
• The wireless network jamming problem
• Exact identification of critical nodes in sparse networks via new compact formulations
• An integer programming framework for critical elements detection in graphs
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
• Cardinality-Constrained Critical Node Detection Problem
• A cutting plane algorithm for computing \(k\)-edge survivability of a network
• Network interdiction via a critical disruption path: branch-and-price algorithms
• Computing Wardropian equilibria in a complementarity framework
• Epidemic dynamics on complex networks
• On node criticality in air transportation networks
• Component importance measures for multi-industry vulnerability of a freight transportation network
• Criticality analysis of internet infrastructure

Cited In (4)

• EIA-CNDP: an exact iterative algorithm for critical node detection problem
• Complexity of the multilevel critical node problem
• The stochastic critical node problem over trees
• Robust critical node selection by Benders decomposition

Uses Software

• Pajek datasets
• SparseMatrix

This page was built for publication: Optimal detection of critical nodes: improvements to model structure and performance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005802)