Minimizing a stochastic maximum-reliability path
From MaRDI portal
Publication:3184595
DOI10.1002/net.20238zbMath1172.90345OpenAlexW4231612634MaRDI QIDQ3184595
Publication date: 21 October 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20238
Stochastic programming (90C15) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (25)
Implementing Automatic Benders Decomposition in a Modern MIP Solver ⋮ The reliable \(p\)-median problem with at-facility service ⋮ Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model ⋮ Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables ⋮ Network reliability: Heading out on the highway ⋮ On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs ⋮ A survey on bilevel optimization under uncertainty ⋮ Prioritized interdiction of nuclear smuggling via tabu search ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set ⋮ Network deployment of radiation detectors with physics-based detection probability calculations ⋮ The Benders Dual Decomposition Method ⋮ Wireless LAN transmitter location under the threat of jamming attacks ⋮ New solution approaches for the maximum-reliability stochastic network interdiction problem ⋮ Deception tactics for network interdiction: A multiobjective approach ⋮ Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications ⋮ Convex hull representation of the deterministic bipartite network interdiction problem ⋮ Risk-averse stochastic path detection ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ Maximum probabilistic all-or-nothing paths ⋮ A survey of network interdiction models and algorithms ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold ⋮ The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms ⋮ The continuous maximum capacity path interdiction problem
Cites Work
- A multicut algorithm for two-stage stochastic linear programs
- The k most vital arcs in the shortest path problem
- Most vital links and nodes in weighted networks
- Deterministic network interdiction
- Finding the most vital arcs in a network
- SPAR: Stochastic Programming with Adversarial Recourse
- Stochastic Network Interdiction
- Interdicting a Nuclear-Weapons Project
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- Shortest-path network interdiction
- A Two-Sided Optimization for Theater Ballistic Missile Defense
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Removing Arcs from a Network
- Optimal interdiction policy for a flow network
- Optimal interdiction of a supply network
This page was built for publication: Minimizing a stochastic maximum-reliability path
