Stochastic Network Interdiction
From MaRDI portal
Publication:2781147
DOI10.1287/opre.46.2.184zbMath0987.90516OpenAlexW2117972428MaRDI QIDQ2781147
David P. Morton, Kelly J. Cormican, R. Kevin Wood
Publication date: 18 March 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.46.2.184
Related Items (85)
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs ⋮ Polynomial-time identification of robust network flows under uncertain arc failures ⋮ Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Optimizing dynamic investment decisions for railway systems protection ⋮ Minimizing a stochastic maximum-reliability path ⋮ Reformulation and sampling to solve a stochastic network interdiction problem ⋮ Shortest path network interdiction with asymmetric information ⋮ Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption ⋮ Protection issues for supply systems involving random attacks ⋮ Stochastic maximum flow interdiction problems under heterogeneous risk preferences ⋮ A mixed-integer programming approach for locating jamming devices in a flow-jamming attack ⋮ The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm ⋮ Applying ranking and selection procedures to long-term mitigation for improved network restoration ⋮ A bi-level programming model for protection of hierarchical facilities under imminent attacks ⋮ Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ Network Inspection for Detecting Strategic Attacks ⋮ Solving multi-period interdiction via generalized Bender's decomposition ⋮ Optimization under Decision-Dependent Uncertainty ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Exact interdiction models and algorithms for disconnecting networks via node deletions ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Integer programming methods for solving binary interdiction games ⋮ Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges ⋮ Designing robust coverage networks to hedge against worst-case facility losses ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ The stochastic critical node problem over trees ⋮ Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem ⋮ A survey on bilevel optimization under uncertainty ⋮ Interdicting restructuring networks with applications in illicit trafficking ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Parametric matroid interdiction ⋮ Efficient algorithms for game-theoretic betweenness centrality ⋮ A two‐stage network interdiction‐monitoring game ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set ⋮ A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ Models and methods for solving the problem of network vulnerability ⋮ Models of the optimal resource allocation for the critical infrastructure protection ⋮ Network deployment of radiation detectors with physics-based detection probability calculations ⋮ A study of network violator interception based on a reliable game model ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Interdiction Games and Monotonicity, with Application to Knapsack Problems ⋮ Protection of flows under targeted attacks ⋮ A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ The maximum clique interdiction problem ⋮ Optimization models of anti-terrorist protection ⋮ Survivable network design under optimal and heuristic interdiction scenarios ⋮ A bilevel mixed-integer program for critical infrastructure protection planning ⋮ Bilevel model for adaptive network flow problem ⋮ Jamming communication networks under complete uncertainty ⋮ Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure ⋮ Network interdiction with asymmetric cost uncertainty ⋮ New solution approaches for the maximum-reliability stochastic network interdiction problem ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Deception tactics for network interdiction: A multiobjective approach ⋮ Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ Risk-averse stochastic path detection ⋮ An interdiction game on a queueing network with multiple intruders ⋮ A computational approach to determine damage in infrastructure networks from outage reports ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Network interdiction to minimize the maximum probability of evasion with synergy between applied resources ⋮ Heuristics for multi-stage interdiction of stochastic networks ⋮ SPAR: Stochastic Programming with Adversarial Recourse ⋮ The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability ⋮ The multi-terminal maximum-flow network-interdiction problem ⋮ Network flow interdiction on planar graphs ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ On the power of randomization in network interdiction ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ A survey of network interdiction models and algorithms ⋮ Branch-and-cut approaches for chance-constrained formulations of reliable network design problems ⋮ Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold ⋮ Risk-Averse Shortest Path Interdiction ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization ⋮ The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms ⋮ An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
This page was built for publication: Stochastic Network Interdiction
