Optimal \(K\)-node disruption on a node-capacitated network

DOI10.1007/s11590-018-1270-xzbMath1425.90125OpenAlexW2802157693WikidataQ129902204 ScholiaQ129902204MaRDI QIDQ2311104

Gokhan Karakose, Ronald G. McGarvey

Publication date: 10 July 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1270-x

zbMATH Keywords

multi-commodity flownetwork interdictioncritical node identificationnode-capacitated network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Uses Software

• SparseMatrix
• GitHub

Cites Work

• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Detecting critical nodes in sparse graphs
• Deterministic network interdiction
• A cutting plane algorithm for computing \(k\)-edge survivability of a network
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• Exact identification of critical nodes in sparse networks via new compact formulations
• The university of Florida sparse matrix collection
• Computing Wardropian equilibria in a complementarity framework
• Shortest-path network interdiction
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal \(K\)-node disruption on a node-capacitated network