Reformulation and sampling to solve a stochastic network interdiction problem

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

Udom Janjarassuk, Jeff Linderoth

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 programmingsample average approximationinterdiction\(L\)-shaped method

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15)

Related Items

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs, Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption, Stochastic maximum flow interdiction problems under heterogeneous risk preferences, A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs, The stochastic critical node problem over trees, A survey on bilevel optimization under uncertainty, Interdicting restructuring networks with applications in illicit trafficking, A survey on mixed-integer programming techniques in bilevel optimization, A two‐stage network interdiction‐monitoring game, Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set, The stochastic interdiction median problem with disruption intensity levels, The impact of sampling methods on bias and variance in stochastic linear programs, Network interdiction with asymmetric cost uncertainty, New solution approaches for the maximum-reliability stochastic network interdiction problem, Convex hull representation of the deterministic bipartite network interdiction problem, A computational approach to determine damage in infrastructure networks from outage reports, The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability, Network flow interdiction on planar graphs, On the power of randomization in network interdiction, Sequential Shortest Path Interdiction with Incomplete Information, A survey of network interdiction models and algorithms, 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, A Unified Framework for Multistage Mixed Integer Linear Optimization, Overlapping Batches for the Assessment of Solution Quality in Stochastic Programs

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