Optimal detection of critical nodes: improvements to model structure and performance
type: Item
instance of: scholarly article
title: Optimal detection of critical nodes: improvements to model structure and performance
author: Gokhan Karakose
author: Ronald G. McGarvey
published in: Networks and Spatial Economics
publication date: 2020-10-08T00:00:00Z
Mathematics Subject Classification ID: 90-XX
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7257992
zbMATH Keywords: network vulnerability
zbMATH Keywords: node disruption
zbMATH Keywords: mixed-integer linear programming
describes a project that uses: Pajek datasets
describes a project that uses: SparseMatrix
MaRDI profile type: Publication
full work available at URL: s11067-018-9407-0
OpenAlex ID: W2811092953
cites work: Detecting critical nodes in sparse graphs
cites work: Cardinality-Constrained Critical Node Detection Problem
cites work: A Two-Sided Optimization for Theater Ballistic Missile Defense
cites work: The wireless network jamming problem
cites work: Component importance measures for multi-industry vulnerability of a freight transportation network
cites work: The university of Florida sparse matrix collection
cites work: Computing Wardropian equilibria in a complementarity framework
cites work: Network interdiction via a critical disruption path: branch-and-price algorithms
cites work: Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
cites work: Strategic network restoration
cites work: A cutting plane algorithm for computing \(k\)-edge survivability of a network
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: Branch and cut algorithms for detecting critical nodes in undirected graphs
cites work: On node criticality in air transportation networks
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: Deterministic network interdiction
cites work: Criticality analysis of internet infrastructure
cites work: Epidemic dynamics on complex networks
DOI: 10.1007/S11067-018-9407-0
Recommended article: Efficient methods for the distance-based critical node detection problem in complex networks
Recommended article: Critical node detection problem for complex network in undirected weighted networks
Recommended article: The bi-objective critical node detection problem
Recommended article: Compact models for critical node detection in telecommunication networks
Recommended article: Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
Recommended article: The critical node detection problem in networks: a survey
Recommended article: Detecting critical node structures on graphs: A mathematical programming approach
Recommended article: Detecting critical nodes in sparse graphs
description: scientific article; zbMATH DE number 7257992