A decomposition algorithm applied to planning the interdiction of stochastic networks

DOI10.1002/nav.20079zbMath1104.90010OpenAlexW2005993581MaRDI QIDQ4680427

Raymond Hemmecke, Harald Held, David L. Woodruff

Publication date: 1 June 2005

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20079

zbMATH Keywords

stochastic programmingnetwork interdictionrisk criterion

Mathematics Subject Classification ID

Related Items (16)

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs ⋮ Reformulation and sampling to solve a stochastic network interdiction problem ⋮ Shortest path network interdiction with asymmetric information ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ A survey on bilevel optimization under uncertainty ⋮ Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ A Brief Overview of Interdiction and Robust Optimization ⋮ Wireless LAN transmitter location under the threat of jamming attacks ⋮ Jamming communication networks under complete uncertainty ⋮ Network interdiction to minimize the maximum probability of evasion with synergy between applied resources ⋮ Heuristics for multi-stage interdiction of stochastic networks ⋮ Sequential Interdiction with Incomplete Information and Learning ⋮ Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction ⋮ Risk-Averse Shortest Path Interdiction ⋮ The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms

Cites Work

• Unnamed Item
• The network inhibition problem

This page was built for publication: A decomposition algorithm applied to planning the interdiction of stochastic networks