Improved formulations for minimum connectivity network interdiction problems
From MaRDI portal
Recommendations
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Connectivity interdiction
- scientific article; zbMATH DE number 2050723
- Optimal detection of critical nodes: improvements to model structure and performance
- On integer and bilevel formulations for the \(k\)-vertex cut problem
Cites work
- An integer programming framework for critical elements detection in graphs
- Complexity of the critical node problem over trees
- Detecting critical nodes in sparse graphs
- Disconnecting graphs by removing vertices: a polyhedral approach
- Enumerating all simple paths in a graph
- Exact identification of critical nodes in sparse networks via new compact formulations
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Finding the k shortest simple paths
- Identifying sets of key players in a social network
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- The University of Florida sparse matrix collection
Cited in
(12)- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
- Complexity of the multilevel critical node problem
- The stochastic critical node problem over trees
- The minimum cost network upgrade problem with maximum robustness to multiple node failures
- Connectivity interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- A computational study of reduction techniques for the minimum connectivity inference problem
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- Critical nodes in interdependent networks with deterministic and probabilistic cascading failures
- Considering the isolation set problem
- On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
This page was built for publication: Improved formulations for minimum connectivity network interdiction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652701)
