{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:33:33Z","timestamp":1759847613489},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2014,11,22]],"date-time":"2014-11-22T00:00:00Z","timestamp":1416614400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s11590-014-0829-4","type":"journal-article","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T20:13:44Z","timestamp":1417464824000},"page":"1477-1494","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Prioritized interdiction of nuclear smuggling via tabu search"],"prefix":"10.1007","volume":"9","author":[{"given":"Dennis P.","family":"Michalopoulos","sequence":"first","affiliation":[]},{"given":"J. Wesley","family":"Barnes","sequence":"additional","affiliation":[]},{"given":"David P.","family":"Morton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,22]]},"reference":[{"key":"829_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)"},{"key":"829_CR2","first-page":"30","volume":"3059","author":"R Aringhieri","year":"2004","unstructured":"Aringhieri, R.: Solving chanced-constrained programs combining tabu search and simulation. WEA 2004, LNCS 3059 3059, 30\u201341 (2004)","journal-title":"WEA 2004, LNCS 3059"},{"key":"829_CR3","doi-asserted-by":"crossref","unstructured":"Barnes, J.W., Laguna, M., Glover, F.: An overview of tabu search approaches to production scheduling problems. In: Intelligent Scheduling Systems. Kluwer Press, Boston (1995)","DOI":"10.1007\/978-1-4615-2263-8_5"},{"issue":"2","key":"829_CR4","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA J. Comput. 6(2), 126\u2013139 (1994)","journal-title":"ORSA J. Comput."},{"key":"829_CR5","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer-Verlag, New York (1997)"},{"key":"829_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1009636520440","volume":"4","author":"D Costa","year":"1998","unstructured":"Costa, D., Silver, E.A.: Tabu search when noise is present: an illustration in the context of cause and effect analysis. J. Heuristics 4, 5\u201323 (1998)","journal-title":"J. Heuristics"},{"key":"829_CR7","doi-asserted-by":"crossref","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201904), pp. 208\u2013217 (2004)","DOI":"10.1109\/FOCS.2004.15"},{"key":"829_CR8","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"RB Dial","year":"1969","unstructured":"Dial, R.B.: Algorithm 360: shortest-path forest with topological ordering. Commun. ACM 12, 632\u2013633 (1969)","journal-title":"Commun. ACM"},{"key":"829_CR9","first-page":"1","volume":"187","author":"NB Dimitrov","year":"2009","unstructured":"Dimitrov, N.B., Michalopoulos, D.P., Morton, D.P., Nehme, M.V., Pan, F., Popova, E., Schneider, E.A., Thoreson, G.G.: Network deployment of radiation detectors with physics-based detection probability calculations. Ann. Oper. Res. 187, 1\u201322 (2009)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"829_CR10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search\u2014part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"829_CR11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search\u2014part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"key":"829_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)"},{"key":"829_CR13","unstructured":"International Atomic Energy Agency: IAEA incident and trafficking database: 2013 fact sheet. http:\/\/www-ns.iaea.org\/security\/itdb.asp . Accessed 17 April 2014 (2014)"},{"key":"829_CR14","doi-asserted-by":"crossref","unstructured":"Ko\u00e7, A., Morton, D.P.: Prioritization via stochastic optimization. Manag. Sci. doi: 10.1287\/mnsc.2013.1865 (2014) (to appear)","DOI":"10.1287\/mnsc.2013.1865"},{"key":"829_CR15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00247208","volume":"2","author":"A L\u00f8kketangen","year":"1996","unstructured":"L\u00f8kketangen, A., Woodruff, D.L.: Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming. J. Heuristics 2, 111\u2013128 (1996)","journal-title":"J. Heuristics"},{"key":"829_CR16","unstructured":"Michalopoulos, D.P.: Prioritization and Optimization in Stochastic Network Interdiction Problems. PhD thesis, The University of Texas, Austin (2008)"},{"key":"829_CR17","doi-asserted-by":"crossref","unstructured":"Michalopoulos, D.P., Morton, D.P., Barnes, J.W.: Prioritizing network interdiction of nuclear smuggling. In: Stochastic Programming: Applications in Finance, Energy and Logistics, Operations Research\/Computer Science Interfaces Series. World Scientific, London (2013)","DOI":"10.1142\/9789814407519_0012"},{"key":"829_CR18","unstructured":"Morton, D.P., Nehme, M.V.: Tightening a network interdiction model. In: IIE Annual Conference Proceedings (2009)"},{"issue":"1","key":"829_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/07408170500488956","volume":"39","author":"DP Morton","year":"2007","unstructured":"Morton, D.P., Pan, F., Saeger, K.J.: Models for nuclear smuggling interdiction. IIE Trans. 39(1), 3\u201314 (2007)","journal-title":"IIE Trans."},{"key":"829_CR20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(02)00192-X","volume":"31","author":"S Pallottino","year":"2003","unstructured":"Pallottino, S., Scutell\u00e0, M.G.: A new algorithm for reoptimizing shortest paths when the arc costs change. Oper. Res. Lett. 31, 149\u2013160 (2003)","journal-title":"Oper. Res. Lett."},{"key":"829_CR21","unstructured":"Pan, F.: Stochastic Network Interdiction: Models and Methods. PhD thesis, The University of Texas, Austin (2005)"},{"key":"829_CR22","doi-asserted-by":"crossref","unstructured":"Pan, F., Morton, D.P.: Minimizing a stochastic maximum-reliability path. Networks 52(3), 111\u2013119 (2008)","DOI":"10.1002\/net.20238"},{"key":"829_CR23","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/nav.21567","volume":"61","author":"KM Sullivan","year":"2014","unstructured":"Sullivan, K.M., Morton, D.P., Pan, F., Smith, J.C.: Securing a border under asymmetric information. Naval Res. Logist. 61, 91\u2013100 (2014)","journal-title":"Naval Res. Logist."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0829-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0829-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0829-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:41Z","timestamp":1559409101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0829-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,22]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["829"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0829-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,22]]}}}