Robust critical node selection by Benders decomposition
From MaRDI portal
Recommendations
- Robust optimization of graph partitioning and critical node detection in analyzing networks
- The bi-objective critical node detection problem
- Optimal detection of critical nodes: improvements to model structure and performance
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Efficient methods for the distance-based critical node detection problem in complex networks
- A note on node aggregation and Benders' decomposition
- An optimal approach for the critical node problem using semidefinite programming
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
Cites work
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- A derandomized approximation algorithm for the critical node detection problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Benchmarking optimization software with performance profiles.
- Benders decomposition approach to robust mixed integer programming
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Cardinality-Constrained Critical Node Detection Problem
- Complexity of the critical node problem over trees
- Epidemic dynamics on complex networks
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Generalized Benders decomposition
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- Linear and quadratic programming approaches for the general graph partitioning problem
- Partitioning procedures for solving mixed-variables programming problems
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Robust optimization of graph partitioning and critical node detection in analyzing networks
- Robust optimization of graph partitioning involving interval uncertainty
- The Price of Robustness
- The wireless network jamming problem
Cited in
(9)- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- Robust optimization of graph partitioning and critical node detection in analyzing networks
- Detecting critical node structures on graphs: a mathematical programming approach
- Fortification Against Cascade Propagation Under Uncertainty
- The stochastic critical node problem over trees
- Bayer digestion maintenance optimisation with lazy constraints and Benders decomposition
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Valid inequalities for the -edge disruptor problem
- Preprocessing and valid inequalities for exact detection of critical nodes via integer programming
This page was built for publication: Robust critical node selection by Benders decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806873)
