Optimal detection of critical nodes: improvements to model structure and performance
From MaRDI portal
Publication:2005802
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
Cites work
- A Two-Sided Optimization for Theater Ballistic Missile Defense
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- An integer programming framework for critical elements detection in graphs
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Cardinality-Constrained Critical Node Detection Problem
- Component importance measures for multi-industry vulnerability of a freight transportation network
- Computing Wardropian equilibria in a complementarity framework
- Criticality analysis of internet infrastructure
- Detecting critical nodes in sparse graphs
- Deterministic network interdiction
- Epidemic dynamics on complex networks
- 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
- Network interdiction via a critical disruption path: branch-and-price algorithms
- On node criticality in air transportation networks
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Strategic network restoration
- The University of Florida sparse matrix collection
- The wireless network jamming problem
Cited in
(18)- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- Detecting critical node structures on graphs: a mathematical programming approach
- Efficient methods for the distance-based critical node detection problem in complex networks
- Compact models for critical node detection in telecommunication networks
- Complexity of the multilevel critical node problem
- The stochastic critical node problem over trees
- A bio-inspired algorithm for identification of critical components in the transportation networks
- An optimal approach for the critical node problem using semidefinite programming
- Robust critical node selection by Benders decomposition
- Efficient heuristic algorithm for identifying critical nodes in planar networks
- Improved formulations for minimum connectivity network interdiction problems
- On node criticality in air transportation networks
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Multilevel approaches for the critical node problem
- Research on the quadratic programming model and solution algorithm of critical nodes in metro network
- Critical arcs detection in influence networks
- Optimal K-node disruption on a node-capacitated network
- Preprocessing and valid inequalities for exact detection of critical nodes via integer programming
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)
