Stochastic Network Interdiction

References

• Ahuja R. K. , Magnanti T. L. , Orlin J. B. Network Flows (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Aneja Y. P. , Nair K. P. K. Maximal expected flow in a network subject to arc failures. Networks (1980) 10 45 57 Crossref, Google Scholar
• Birge J. R. The value of the stochastic solution in stochastic linear programs with fixed recourse. Math. Prog. (1982) 24 314 325 Crossref, Google Scholar
• Birge J. R. , Dempster M. A. H. , Gassmann H. I. , Gunn E. A. , King A. J. , Wallace S. W. A standard input format for multiperiod stochastic linear programs. COAL: Committee Algorithms Math. Programming Soc. (1987) 17 1 19 Google Scholar
• Birge J. R. , Wallace S. W. A separable piecewise linear upper bound for stochastic linear programs. SIAM J. Control Optim. (1988) 26 725 739 Crossref, Google Scholar
• Birge J. R. , Wets R. J.-B. Sublinear upper bounds for stochastic programs with recourse. Math. Prog. (1989) 43 131 149 Crossref, Google Scholar
• Birge J. R. , Wets R. J.-B. Designing approximation schemes for stochastic optimization problems, in particular, for stochastic programs with recourse. Math Prog. Stud. (1986) 27 54 102 Crossref, Google Scholar
• Caccetta L. Vulnerability of communication networks. Networks (1984) 14 141 146 Crossref, Google Scholar
• Carey M. , Hendrickson C. Bounds on expected performance of networks with links subject to failure. Networks (1984) 14 439 456 Crossref, Google Scholar
• Donohue C. J. , Birge J. R. An upper bound on the expected value of a non-increasing convex function with convex marginal return functions. (1995a) . Working paper, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI Google Scholar
• Donohue C. J. , Birge J. R. An upper bound on the network recourse function. (1995b) . Working paper, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI Google Scholar
• Evans J. R. Maximal flow in probabilistic graphs: The discrete case. Networks (1976) 6 161 183 Crossref, Google Scholar
• Frauendorfer K. Stochastic Two-Stage Programming (1992) . Lecture Notes in Economics and Mathematical Systems 392, Springer-Verlag, Berlin Crossref, Google Scholar
• Goddard W. Measures of vulnerability—The integrity family. Networks (1994) 24 207 213 Crossref, Google Scholar
• Hausch D. B. , Ziemba W. T. Bounds on the value of information in uncertain decision problems II. Stochastics (1983) 10 181 217 Crossref, Google Scholar
• Huang C. C. , Ziemba W. T. , Ben-Tal A. Bounds on the expectation of a convex function of a random variable with applications to stochastic programming. Opns. Res. (1977) 25 315 325 Link, Google Scholar
• IBM Corporation Optimization Subroutine Library Guide and Reference, Release 2 (1991) (Kingston, NY) Google Scholar
• Kall P. , Ruszczyński A. , Frauendorfer K. , Ermoliev Y. , Wets R. J.-B. Approximation techniques in stochastic programming. Numerical Techniques for Stochastic Optimization (1988) (Springer Verlag, Berlin) Crossref, Google Scholar
• Laporte G. , Louveaux F. V. The integer L-shaped method for stochastic integer programs with complete recourse. O. R. Letts. (1993) 13 133 142 Crossref, Google Scholar
• Madansky A. Bounds on the expectation of a convex function of a multivariate random variable. Ann. Math. Statist. (1959) 30 743 746 Crossref, Google Scholar
• Morton D. P. A sampling-based algorithm for two-stage stochastic linear programming. (1995) . Working paper, Department of Mechanical Engineering, The University of Texas at Austin Google Scholar
• McMasters A. W. , Mustin T. M. Optimal interdiction of a supply network. Naval Res. Logist. (1970) 17 261 268 Crossref, Google Scholar
• Phillips C. A. The network destruction problem. (1992) (Sandia National Laboratories, Albuquerque, NM) . SAND-92-0186C Google Scholar
• Steinrauf R. L. A network interdiction model. (1991) . M.S. thesis, Naval Postgraduate School, Monterey, CA Google Scholar
• Van Slyke R. M. , Wets R. J.-B. L-Shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. (1969) 17 638 663 Crossref, Google Scholar
• Wallace S. W. Investing in arcs in a network to maximize the expected max flow. Networks (1987a) 17 87 103 Crossref, Google Scholar
• Wallace S. W. A piecewise linear upper bound on the network recourse function. Math. Prog. (1987b) 38 133 146 Crossref, Google Scholar
• Washburn A. R. , Wood R. K. Deterministic network interdiction. Opns. Res. (1995) 43 243 251 Link, Google Scholar
• Wets R. J.-B. Programming under uncertainty: The equivalent convex program. SIAM J. Appl. Math. (1966) 14 89 105 Crossref, Google Scholar
• Wollmer R. D. Removing arcs from a network. J. Opns. Soc. Amer. (1964) 12 934 940 Google Scholar
• Wollmer R. D. Two-stage linear programming under uncertainty with 0-1 integer first-stage variables. Math. Prog. (1980) 19 279 288 Crossref, Google Scholar
• Wood R. K. Deterministic network interdiction. Math. Comput. Model. (1993) 17 1 18 Crossref, Google Scholar