Risk-Averse Shortest Path Interdiction
From MaRDI portal
Publication:2830955
DOI10.1287/ijoc.2016.0699zbMath1348.91077OpenAlexW2432207361MaRDI QIDQ2830955
Publication date: 1 November 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/54bd51eb20fc2d4402d6fc2e087df7db460c9c10
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43) Applications of game theory (91A80) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (15)
Stochastic maximum flow interdiction problems under heterogeneous risk preferences ⋮ A survey on bilevel optimization under uncertainty ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set ⋮ Shortest path network interdiction with asymmetric uncertainty ⋮ Risk Averse Shortest Paths: A Computational Study ⋮ Interdiction Games and Monotonicity, with Application to Knapsack Problems ⋮ Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm ⋮ The maximum clique interdiction problem ⋮ Risk-averse stochastic path detection ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Pessimistic evasive flow capturing problems ⋮ A survey of network interdiction models and algorithms ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
Uses Software
Cites Work
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- An integer programming approach for linear programs with probabilistic constraints
- Sequence independent lifting in mixed integer programming
- On mixing sets arising in chance-constrained programming
- Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
- Stochastic Network Interdiction
- Chance-Constrained Binary Packing Problems
- Reformulation and sampling to solve a stochastic network interdiction problem
- UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
- Sequence Independent Lifting for Mixed-Integer Programming
- Technical Note—A Note on Zero-One Programming
- A problem in network interdiction
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- A decomposition algorithm applied to planning the interdiction of stochastic networks
- Shortest-path network interdiction
- On the online shortest path problem with limited arc cost dependencies
- Two-Person Zero-Sum Games for Network Interdiction
- Stochastic shortest path problems with recourse
- Distribution of the Time Through a Directed, Acyclic Network
- Shortest Paths in Probabilistic Graphs
- Removing Arcs from a Network
- On the history of the transportation and maximum flow problems
This page was built for publication: Risk-Averse Shortest Path Interdiction
