A stochastic program for interdicting smuggled nuclear material

Operations Research/ Computer Science Interfaces Series

Volumn 22, Issue , 2003, Pages 1-19

  Pan, Feng ^a   Charlton, William S ^a   Morton, David P ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Network interdiction; Stochastic programming

Indexed keywords

EID: 84888811685     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/0-306-48109-x_1     Document Type: Article

References (27)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice Hall, Upper Saddle River, NJ, 1993.
2. O. Ben-Ayed. Bi-level linear programming. Computers and Operations Research, 20:485-501, 1993.
3. G.G. Brown, R.F. Dell, and R.K. Wood. Optimization and persistence. Interfaces, 27:15-37, 1997.
4. M.O. Ball, B.L. Golden, and R.V. Vohra. Finding the most vital arcs in a network. Operations Research Letters, 8:73-76, 1989.
5. A. Brooke, D. Kendrick, A. Meeraus, and R. Raman. GAMS, A User's Guide, 1998. http://www.gams.com/.
6. A. Bar-Noy, S. Khuller, and B. Schieber. The complexity of finding most vital arcs and nodes. Technical Report CS-TR-35-39, Computer Science Department, University of Maryland,1995.
7. J. Bard and J. Moore. A branch and bound algorithm for the bi-level programming problem. SIAM Journal on Scientific and Statistical Computing, 11:281-292, 1990.
8. M.S. Chern and K.C. Lin. Interdicting the activities of a linear program-a parametric approach. European Journal of Operational Research, 86:580-591, 1995.
9. K. Cormican, D.P. Morton, and R.K. Wood. Stochastic network interdiction. Operations Research, 46:184-197, 1998.
10. ILOG CPLEX 7.1 User's Manual, 2001.
11. H.W. Cor ley and D.Y. Sha. Most vital links and nodes in weighted networks. Operations Research Letters, 1:157-160, 1982.
12. D.R. Fulkerson and G.C. Harding. Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming, 13:116-118, 1977.
13. P.M. Ghare, D.C. Montgomery, and T.M. Turner. Optimal interdiction policy for a flow network. Naval Research Logistics Quarterly, 18:37-45, 1971.
14. B. Golden. A problem in network interdiction. Naval Research Logistics Quarterly, 25:711-713, 1978.
15. E. Israeli. System interdiction and defense. Operations Research Department, Naval Postgraduate School, Monterey, California, 1999. PhD Dissertation.
16. E. Israeli and R.K. Wood. Shortest-path network interdiction. Networks, to appear.
17. E. Israeli and R.K. Wood. System interdiction and defense. Working paper, Operations Research Department, Naval Postgraduate School, Monterey, CA, 2001.
18. G. Laporte and F.V. Louveaux. The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13:133-142, 1993.
19. A.W. McMasters and T.M. Mustin. Optimal interdiction of a supply network. Naval Research Logistics Quarterly, 17:261-268, 1970.
20. K. Malik, A.K. Mittal, and S.K. Gupta. The k-most vital arcs in the shortest path problem. Operations Research Letters, 8:223-227, 1989.
21. D.P. Morton and R.K. Wood. Restricted-recourse bounds for stochastic linear programming. Operations Research, 47:943-956, 1999.
22. B.K. Reed. Models for proliferation interdiction response analysis. Operations Research Department, Naval Postgraduate School, Monterey, California, 1994. M.S. Thesis.
23. R.M. Van Slyke and R.J.-B. Wets. L-shaped linear programs with applications to optimal control and stochastic programming. SIAM Journal on Applied Mathematics, 17:638-663, 1969.
24. R.D. Wollmer. Removing arcs from a network. Journal of the Operations Research Society of America, 12:934-940, 1964.
25. R.D. Wollmer. Two-stage linear programming under uncertainty with 0 - 1 integer first stage variables. Mathematical Programming, 19:279-288, 1980.
26. R.K. Wood. Deterministic network interdiction. Mathematical and Computer Modeling, 17:1-18, 1993.
27. A.R. Washburn and R.K. Wood. Two-person zero-sum games for network interdiction. Operations Research, 43:243-251, 1994.