The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
From MaRDI portal
Publication:4994144
DOI10.1287/opre.2020.2023zbMath1466.91067OpenAlexW3114206338MaRDI QIDQ4994144
Publication date: 17 June 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2020.2023
Analysis of algorithms (68W40) Noncooperative games (91A10) Hierarchical games (including Stackelberg games) (91A65) Stochastic programming (90C15) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Decomposition of probability marginals for security games in abstract networks ⋮ A two‐stage network interdiction‐monitoring game ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of stochastic programs with decision dependent random elements
- Adaptivity in network interdiction
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Deterministic network interdiction
- Finding the most vital arcs in a network
- Network interdiction and stochastic integer programming
- Heuristics for multi-stage interdiction of stochastic networks
- A class of stochastic programs with decision dependent uncertainty
- Sur quelques applications des fonctions convexes et concaves au sens de I. Schur
- Stochastic Network Interdiction
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- Lectures on Stochastic Programming
- Maximizing the minimum source-sink path subject to a budget constraint
- Securing a border under asymmetric information
- Deception tactics for network interdiction: A multiobjective approach
- A decomposition algorithm applied to planning the interdiction of stochastic networks
- Sequential Shortest Path Interdiction with Incomplete Information
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- An Algorithm for Separable Nonconvex Programming Problems
- Fare Evasion in Transit Networks
- A Backward Sampling Framework for Interdiction Problems with Fortification
- Inequalities: theory of majorization and its applications
This page was built for publication: The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
