Robust Critical Node Selection by Benders Decomposition
From MaRDI portal
Publication:2806873
DOI10.1287/ijoc.2015.0671zbMath1337.90073OpenAlexW2270320935MaRDI QIDQ2806873
Joe Naoum-Sawaya, Christoph Buchheim
Publication date: 19 May 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/88f6f8723123d1f61a22914f74ffda3a359ce6cf
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (5)
Fortification Against Cascade Propagation Under Uncertainty ⋮ The stochastic critical node problem over trees ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem
Uses Software
Cites Work
- Unnamed Item
- A derandomized approximation algorithm for the critical node detection problem
- Robust optimization of graph partitioning involving interval uncertainty
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- Complexity of the critical node problem over trees
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- Partitioning procedures for solving mixed-variables programming problems
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Linear and quadratic programming approaches for the general graph partitioning problem
- The wireless network jamming problem
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Epidemic dynamics on complex networks
- A Benders decomposition approach for the robust spanning tree problem with interval data
- Generalized Benders decomposition
- Cardinality-Constrained Critical Node Detection Problem
- Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
- The Price of Robustness
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Benchmarking optimization software with performance profiles.
This page was built for publication: Robust Critical Node Selection by Benders Decomposition
