A decomposition algorithm applied to planning the interdiction of stochastic networks
From MaRDI portal
Publication:4680427
DOI10.1002/nav.20079zbMath1104.90010MaRDI 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
Related Items
Sequential Interdiction with Incomplete Information and Learning, The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms, 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, Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs, Wireless LAN transmitter location under the threat of jamming attacks, Network interdiction to minimize the maximum probability of evasion with synergy between applied resources, The stochastic interdiction median problem with disruption intensity levels, Jamming communication networks under complete uncertainty, Heuristics for multi-stage interdiction of stochastic networks, Risk-Averse Shortest Path Interdiction, Reformulation and sampling to solve a stochastic network interdiction problem, Shortest path network interdiction with asymmetric information, A Brief Overview of Interdiction and Robust Optimization, Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction
Cites Work
