Stochastic network interdiction

Operations Research

Volumn 46, Issue 2, 1998, Pages 184-197

  Cormican, Kelly J ^a   Morton, David P ^b   Wood, R Kevin ^a  

^a NAVAL POSTGRADUATE SCHOOL   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; GAME THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES;

EXPECTED VALUE PROBLEMS; STOCHASTIC NETWORKS;

MILITARY OPERATIONS;

EID: 0032024334     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.2.184     Document Type: Article

References (15)

1. AHUJA, R. K., T. L. MAGNANTI, AND J. B. ORLIN. 1993. Network Flows. Prentice Hall, Englewood Cliffs, NJ.
2. ANEJA, Y. P., AND K. P. K. NAIR. 1980. Maximal Expected Flow in a Network Subject to Arc Failures. Networks 10, 45-57.
3. BIRGE, J. R. 1982. The Value of the Stochastic Solution in Stochastic Linear Programs with Fixed Recourse. Math. Prog. 24, 314-325.
4. BIRGE, J. R., M. A. H. DEMPSTER, H. I. GASSMANN, E. A. GUNN, A. J. KING, AND S. W. WALLACE. 1987. A Standard Input Format for Multiperiod Stochastic Linear Programs. COAL: Committee on Algorithms of the Mathematical Programming Society 17, 1-19.
5. BIRGE, J. R., AND S. W. WALLACE. 1988. A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs. SIAM J. Control Optim. 26, 725-739.
6. BIRGE, J. R., AND R. J.-B. WETS. 1989. Sublinear Upper Bounds for Stochastic Programs with Recourse. Math. Prog. 43, 131-149.
7. BIRGE, J. R., AND R. J.-B. WETS. 1986. Designing Approximation Schemes for Stochastic Optimization Problems, in Particular, for Stochastic Programs with Recourse. Math Prog. Study 27, 54-102.
8. CACCETTA, L. 1984. Vulnerability of Communication Networks. Networks 14, 141-146.
9. CAREY, M., AND C. HENDRICKSON. 1984. Bounds on Expected Performance of Networks with Links Subject to Failure. Networks 14, 439-456.
10. DONOHUE, C. J., AND J. R. BIRGE. 1995a. An Upper Bound on the Expected Value of a Non-Increasing Convex Function with Convex Marginal Return Functions. Working Paper, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI.
11. DONOHUE, C. J., AND J. R. BIRGE. 1995b. An Upper Bound on the Network Recourse Function. Working Paper, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI.
12. EVANS, J. R. 1976. Maximal Flow in Probabilistic Graphs: The Discrete Case. Networks 6, 161-183.
13. FRAUENDORFER, K. 1992. Stochastic Two-Stage Programming. Lecture Notes in Economics and Mathematical Systems 392, Springer-Verlag, Berlin.
14. WOLLMER, R. D. 1980. Two-Stage Linear Programming Under Uncertainty with 0-1 Integer First-Stage Variables. Math. Prog. 19, 279-288.
15. WOOD, R. K. 1993. Deterministic Network Interdiction. Math. Comput. Modelling 17, 1-18.