Minimizing a stochastic maximum-reliability path

DOI10.1002/net.20238zbMath1172.90345MaRDI QIDQ3184595

David P. Morton, Feng Pan

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

zbMATH Keywords

stochastic programming; network interdiction; valid inequality

Mathematics Subject Classification ID

90C15: Stochastic programming

90B15: Stochastic network models in operations research

90B25: Reliability, availability, maintenance, inspection in operations research

Related Items

Deception tactics for network interdiction: A multiobjective approach, Sequential Shortest Path Interdiction with Incomplete Information, The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms, Implementing Automatic Benders Decomposition in a Modern MIP Solver, On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs, The Benders Dual Decomposition Method, A survey on bilevel optimization under uncertainty, The reliable \(p\)-median problem with at-facility service, Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model, Network deployment of radiation detectors with physics-based detection probability calculations, Prioritized interdiction of nuclear smuggling via tabu search, Wireless LAN transmitter location under the threat of jamming attacks, Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications, Risk-averse stochastic path detection, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, New solution approaches for the maximum-reliability stochastic network interdiction problem, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, The continuous maximum capacity path interdiction problem, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Convex hull representation of the deterministic bipartite network interdiction problem, 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

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