The stochastic critical node problem over trees

DOI10.1002/net.21948arXiv1812.06456OpenAlexW3031275016MaRDI QIDQ6092626

Rosario Scatamacchia, Pierre Hosteins

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.06456

zbMATH Keywords

approximation algorithmstochastic integer programmingtreesBenders decompositioncritical node problemnetwork interdictionprobability chainscritical element detection

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Component-cardinality-constrained critical node problem in graphs
• A genetic algorithm for a class of critical node problems
• Network interdiction via a critical disruption path: branch-and-price algorithms
• A randomized algorithm with local search for containment of pandemic disease spread
• An integer programming framework for critical elements detection in graphs
• Complexity of the critical node problem over trees
• Catastrophic cascading failures in power networks
• Detecting critical nodes in sparse graphs
• Partitioning procedures for solving mixed-variables programming problems
• Most vital links and nodes in weighted networks
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
• Improved formulations for minimum connectivity network interdiction problems
• The critical node detection problem in networks: a survey
• The Benders decomposition algorithm: a literature review
• Deterministic network interdiction
• Finding the most vital arcs in a network
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Optimal detection of critical nodes: improvements to model structure and performance
• A survey of network interdiction models and algorithms
• Probability chains: a general linearization technique for modeling reliability in facility location and related problems
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Exact identification of critical nodes in sparse networks via new compact formulations
• Epidemic dynamics on complex networks
• Stochastic Network Interdiction
• Robust Critical Node Selection by Benders Decomposition
• Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
• Reformulation and sampling to solve a stochastic network interdiction problem
• Finding the n Most Vital Nodes in a Flow Network
• Detecting critical node structures on graphs: A mathematical programming approach
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
• Shortest-path network interdiction
• Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
• An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse

This page was built for publication: The stochastic critical node problem over trees