Heuristics for multi-stage interdiction of stochastic networks

DOI10.1007/s10732-005-3122-yzbMath1122.90318MaRDI QIDQ2491320

David L. Woodruff, Harald Held

Publication date: 29 May 2006

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-005-3122-y

zbMATH Keywords

stochastic programming; GRASP; local search; network interdiction

Mathematics Subject Classification ID

90C15: Stochastic programming

90B15: Stochastic network models in operations research

Related Items

A rolling horizon approach for stochastic mixed complementarity problems with endogenous learning: application to natural gas markets, Reduction of nonanticipativity constraints in multistage stochastic programming problems with endogenous and exogenous uncertainty, A dynamic reformulation heuristic for generalized interdiction problems, The stochastic interdiction median problem with disruption intensity levels, Decision-dependent probabilities in stochastic programs with recourse, Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction, Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution, A class of stochastic programs with decision dependent uncertainty, Efficient constraint reduction in multistage stochastic programming problems with endogenous uncertainty

Uses Software

• GRASP

Cites Work

• Semi-greedy heuristics: An empirical study
• Finding the most vital arcs in a network
• Applying the minimum risk criterion in stochastic recourse programs
• Network interdiction and stochastic integer programming
• Stochastic Network Interdiction
• Maximizing the minimum source-sink path subject to a budget constraint
• A problem in network interdiction
• A decomposition algorithm applied to planning the interdiction of stochastic networks
• Shortest-path network interdiction
• The network inhibition problem
• Unnamed Item
• Unnamed Item
• Unnamed Item