Reformulation and sampling to solve a stochastic network interdiction problem

DOI10.1002/net.20237zbMath1173.90345MaRDI QIDQ3184597

Jeff Linderoth, Udom Janjarassuk

Publication date: 21 October 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20237

zbMATH Keywords

stochastic programming; sample average approximation; interdiction; \(L\)-shaped method

Mathematics Subject Classification ID

90C15: Stochastic programming

90B15: Stochastic network models in operations research

Related Items

The impact of sampling methods on bias and variance in stochastic linear programs, Network flow interdiction on planar graphs, The stochastic interdiction median problem with disruption intensity levels, The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability

Uses Software

• FATCOP
• HTCondor MW
• SUTIL

Cites Work

• Unnamed Item
• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• A multicut algorithm for two-stage stochastic linear programs
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Decomposition algorithms for stochastic programming on a computational grid
• The sample average approximation method applied to stochastic routing problems: a computational study
• A stochastic programming approach for supply chain network design under uncertainty
• Variance reduction in sample approximations of stochastic programs
• The empirical behavior of sampling methods for stochastic programming
• On the Stackelberg strategy in nonzero-sum games
• On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
• FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver
• Stochastic Network Interdiction
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• 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
• Two-Person Zero-Sum Games for Network Interdiction
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• Removing Arcs from a Network
• Optimal interdiction of a supply network