Optimal K-node disruption on a node-capacitated network
From MaRDI portal
Optimal \(K\)-node disruption on a node-capacitated network
Recommendations
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Optimal detection of critical nodes: improvements to model structure and performance
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- The multi-terminal maximum-flow network-interdiction problem
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach
Cites work
- scientific article; zbMATH DE number 3173143 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- Computing Wardropian equilibria in a complementarity framework
- Detecting critical nodes in sparse graphs
- Deterministic network interdiction
- Exact identification of critical nodes in sparse networks via new compact formulations
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
- Shortest-path network interdiction
- The University of Florida sparse matrix collection
This page was built for publication: Optimal \(K\)-node disruption on a node-capacitated network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311104)
