Models for nuclear smuggling interdiction

IIE Transactions (Institute of Industrial Engineers)

Volumn 39, Issue 1, 2007, Pages 3-14

  Morton, David P ^a   Pan, Feng ^b   Saeger, Kevin J ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Integer programming; Network interdiction; Stochastic programming

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; SENSORS; STOCHASTIC PROGRAMMING;

NETWORK INTERDICTION; NUCLEAR SMUGGLING; RADIATION SENSORS;

OPERATIONS RESEARCH;

EID: 33750629476     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170500488956     Document Type: Article

References (39)

1. Ahuja, R. and Magnanti, T. and Orlin, J.(1993) Network Flows. Upper Saddle River NJ: Prentice Hall.
2. Bailey, M. and Bayrak, H.(2005) Network interdiction under asymmetric information. Pittsburgh PA: Industrial Engineering Department, University of Pittsburgh. Technical report, 15260
3. Bailey, M. and Shechter, S. and Schaefer, A.(2004) SPAR: Stochastic programming with adversarial recourse. Pittsburgh PA: Industrial Engineering Department, University of Pittsburgh. Technical report, 15260
4. Ball, D.(1998) The US second line of defense: Preventing nuclear smuggling across Russia's borders. Washington DC: Center for the Strategic and International Studies. PONARS memo # 50
5. Ball, M. and Golden, B. and Vohra, R. (1989) Finding the most vital arcs in a network Operations Research Letters, 8, pp. 73-76. http://www.csa.com/htbin/linkabst.cgi?issn=0167-6377&vol=8&iss= &firstpage=73[CSA]
6. Bard, J. (1991) Some properties of the bilevel programming problem Journal of Optimization Theory and Applications, 68, pp. 371-378. http:// www.csa.com/htbin/linkabst.cgi?issn=0022-3239&vol=68&iss= &firstpage=371 http://dx.doi.org/10.1007%2FBF00941574
7. Bard, J.(1998) Practical Bilevel Optimization: Algorithms and Applications. Boston MA: Kluwer.
8. Ben-Ayed, O. (1993) Bi-level linear programming Computers & Operations Research, 20, pp. 485-501. http://www.csa.com/htbin/ linkabst.cgi?issn=0305-0548&vol=20&iss=&firstpage=485 http://dx.doi.org/10.1016%2F0305-0548%2893%2990013-9
9. Benders, J. (1962) Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik, 4, pp. 238-252. http://www.csa.com/htbin/linkabst.cgi?issn=0029-599X&vol=4&iss= &firstpage=238 http://dx.doi.org/10.1007%2FBF01386316
10. Brown, G. and Carlyle, M. and Harney, R. and Skroch, E. and Wood, R.(2004) How to optimally interdict a belligerent project to develop a nuclear weapon. Monterey CA: Operations Research Department, Naval Postgraduate School. Technical report, 93943
11. Chern, M. and Lin, K. (1995) Interdicting the activities of a linear program - a parametric approach European Journal of Operational Research, 86, pp. 580-591. http://www.csa.com/htbin/linkabst.cgi?issn= 0377-2217&vol=86&iss=&firstpage=580 http://dx.doi.org/ 10.1016%2F0377-2217%2894%2900057-J
12. Cobb, D.(2002) Statement of Associate Director, Threat Reduction, Los Alamos National Laboratory, submitted to Committee on Energy and Natural Resources, US Senate, July 10
13. Corley, H. and Sha, D. (1982) Most vital links and nodes in weighted networks Operations Research Letters, 1, pp. 157-160. http://www.csa.com/ htbin/linkabst.cgi?issn=0167-6377&vol=1&iss=&firstpage=157 http://dx.doi.org/10.1016%2F0167-6377%2882%2990020-7
14. Cormican, K. and Morton, D. and Wood, R. (1998) Stochastic network interdiction Operations Research, 46, pp. 184-197. http://www.csa.com/ htbin/linkabst.cgi?issn=0030-364X&vol=46&iss=&firstpage=184
15. Fulkerson, D. and Harding, G. (1977) Maximizing the minimum source-sink path subject to a budget constraint Mathematical Programming, 13, pp. 116-118. http://www.csa.com/htbin/linkabst.cgi?issn=0025-5610&vol= 13&iss=&firstpage=116 http://dx.doi.org/10.1007%2FBF01584329
16. Geoffrion, A. (1972) Generalized Benders decomposition Journal of Optimization Theory and Applications, 10, pp. 237-260. http://www.csa.com/htbin/linkabst.cgi?issn=0022-3239&vol=10&iss= &firstpage=237 http://dx.doi.org/10.1007%2FBF00934810
17. Ghare, P. and Montgomery, D. and Turner, T. (1971) Optimal interdiction policy for a flow network Naval Research Logistics Quarterly, 18, pp. 37-45. http://www.csa.com/htbin/linkabst.cgi?issn=0028-1441&vol= 18&iss=&firstpage=37
18. Golden, B. (1978) A problem in network interdiction Naval Research Logistics Quarterly, 25, pp. 711-713. http://www.csa.com/htbin/ linkabst.cgi?issn=0028-1441&vol=25&iss=&firstpage=711
19. Hemmecke, R. and Schultz, R. and Woodruff, D.(2003) Interdicting stochastic networks with binary interdiction effort. In Network Interdiction and Stochastic Integer Programming. Boston MA: Kluwer.
20. International Atomic Energy Agency.(2004) Illicit nuclear trafficking database. International Atomic Energy Agency. available at http://www.iaea.org/NewsCenter/Features/RadSources/Fact_Figureshtml Accessed 25 September 2006
21. Ishizuka, Y. and Shimizu, K. and Bard, J.(1997) Nondifferentiable and Two-Level Programming. Boston MA: Kluwer.
22. Israeli, E. and Wood, R.(2001) System interdiction and defense. Monterey CA: Operations Research Department, Naval Postgraduate School. Working paper, 93943
23. Israeli, E. and Wood, R. (2002) Shortest-path network interdiction Networks, 40, pp. 97-111. http://www.csa.com/htbin/linkabst.cgi?issn= 1566-113X&vol=40&iss=&firstpage=97 http://dx.doi.org/ 10.1002%2Fnet.10039
24. Jones, G.(2002) Nuclear nonproliferation: US efforts to help other countries combat nuclear smuggling need strengthened coordination and planning, Report to the Ranking Minority Member, Subcommittee on Emerging Threats, and Capabilities, Committee on Armed Services, US Senate, GAO-02-426, May 2002
25. Kelley, J. (1960) The cutting plane method for solving convex programs SIAM Journal of Industrial and Applied Mathematics, 8, pp. 703-712. http://www.csa.com/htbin/linkabst.cgi?issn=&vol=8&iss= &firstpage=703 http://dx.doi.org/10.1137%2F0108053
26. Laporte, G. and Louveaux, F. (1993) The integer L-shaped method for stochastic integer programs with complete recourse Operations Research Letters, 13, pp. 133-142. http://www.csa.com/htbin/linkabst.cgi?issn= 0167-6377&vol=13&iss=&firstpage=133 http://dx.doi.org/ 10.1016%2F0167-6377%2893%2990002-X
27. Malik, K. and Mittal, A. and Gupta, S. (1989) The k-most vital arcs in the shortest path problem Operations Research Letters, 8, pp. 223-227. http://www.csa.com/htbin/linkabst.cgi?issn=0167-6377&vol=8&iss= &firstpage=223 http://dx.doi.org/10.1016%2F0167-6377%2889%2990065-5
28. McMasters, A. and Mustin, T. (1970) Optimal interdiction of a supply network Naval Research Logistics Quarterly, 17, pp. 261-268. http://www.csa.com/htbin/linkabst.cgi?issn=0028-1441&vol=17&iss= &firstpage=261
29. Morton, D. and Wood, R. (1999) Restricted-recourse bounds for stochastic linear programming Operations Research, 47, pp. 943-956. http://www.csa.com/htbin/linkabst.cgi?issn=0030-364X&vol=47&iss= &firstpage=943
30. National Nuclear Security Administration.(2006) Office of International Material Protection and Cooperation. Department of Energy and National Nuclear Security Administration. Overview of NA-25. available at http://www.nnsa.doe.gov/na-20/na25_fact.shtml http://www.nnsa.doe.gov/ na-20/na25_fact.shtml. Accessed 25 September 2006
31. Pan, F.(2005) Models and methods for stochastic network interdiction. Austin TX: The University of Texas at Austin. 78712
32. Pan, F. and Charlton, W. and Morton, D.(2003) Interdicting smuggled nuclear material. In Network Interdiction and Stochastic Integer Programming. Boston MA: Kluwer.
33. Reed, B.(1994) Models for proliferation interdiction response analysis. Monterey CA: Naval Postgraduate School. 93943
34. Richardson, B.(1998) Department of Energy press release: Russian Federation dedicate "second line of defense". US nuclear detection technology to help secure Russian borders. September 2
35. Van Slyke, R. and Wets, R. (1969) L-shaped linear programs with applications to optimal control and stochastic programming SIAM Journal on Applied Mathematics, 17, pp. 638-663. http://www.csa.com/htbin/ linkabst.cgi?issn=0036-1399&vol=17&iss=&firstpage=638 http://dx.doi.org/10.1137%2F0117061
36. Washburn, A. and Wood, R. (1994) Two-person zero-sum games for network interdiction Operations Research, 43, pp. 243-251. http://www.csa.com/ htbin/linkabst.cgi?issn=0030-364X&vol=43&iss=&firstpage=243
37. Wollmer, R. (1964) Removing arcs from a network Operations Research, 12, pp. 934-940. http://www.csa.com/htbin/linkabst.cgi?issn= 0030-364X&vol=12&iss=&firstpage=934
38. Wollmer, R. (1980) Two-stage linear programming under uncertainty with 0-1 integer first stage variables Mathematical Programming, 19, pp. 279-288. http://www.csa.com/htbin/linkabst.cgi?issn=0025-5610&vol= 19&iss=&firstpage=279 http://dx.doi.org/10.1007%2FBF01581648
39. Wood, R. (1993) Deterministic network interdiction Mathematical and Computer Modeling, 17, pp. 1-18. http://www.csa.com/htbin/ linkabst.cgi?issn=&vol=17&iss=&firstpage=1 http://dx.doi.org/ 10.1016%2F0895-7177%2893%2990236-R