Robust optimization of graph partitioning and critical node detection in analyzing networks
From MaRDI portal
Recommendations
- Robust optimization of graph partitioning involving interval uncertainty
- Robust critical node selection by Benders decomposition
- An optimal approach for the critical node problem using semidefinite programming
- Detecting critical node structures on graphs: a mathematical programming approach
- A fast greedy algorithm for the critical node detection problem
Cited in
(14)- The critical node detection problem in networks: a survey
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Optimal detection of critical nodes: improvements to model structure and performance
- Exact identification of critical nodes in sparse networks via new compact formulations
- Robust critical node selection by Benders decomposition
- Component-cardinality-constrained critical node problem in graphs
- Graph clustering via intra-cluster density maximization
- Robust optimization of graph partitioning involving interval uncertainty
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
- A robust optimization approach for multicast network coding under uncertain link costs
- Critical node/edge detection problems on trees
- The stochastic critical node problem over trees
- Graph clustering with Boltzmann machines
This page was built for publication: Robust optimization of graph partitioning and critical node detection in analyzing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066154)
