{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T20:09:27Z","timestamp":1776370167340,"version":"3.51.2"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T00:00:00Z","timestamp":1529107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T00:00:00Z","timestamp":1529107200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1130266"],"award-info":[{"award-number":["CMMI-1130266"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["SES-1422768"],"award-info":[{"award-number":["SES-1422768"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10287-018-0321-1","type":"journal-article","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T05:27:43Z","timestamp":1529126863000},"page":"455-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["New solution approaches for the maximum-reliability stochastic network interdiction problem"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3859-345X","authenticated-orcid":false,"given":"Eli","family":"Towle","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9265-7728","authenticated-orcid":false,"given":"James","family":"Luedtke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,16]]},"reference":[{"issue":"1\u20132","key":"321_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","volume":"128","author":"S Ahmed","year":"2011","unstructured":"Ahmed S, Atamt\u00fcrk A (2011) Maximizing a class of submodular utility functions. Math Program 128(1\u20132):149\u2013169","journal-title":"Math Program"},{"key":"321_CR2","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Upper Saddle River"},{"issue":"2","key":"321_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"FA Al-Khayyal","year":"1983","unstructured":"Al-Khayyal FA, Falk JE (1983) Jointly constrained biconvex programming. Math Oper Res 8(2):273\u2013286","journal-title":"Math Oper Res"},{"issue":"1","key":"321_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/ijoc.2016.0717","volume":"29","author":"M Bodur","year":"2016","unstructured":"Bodur M, Dash S, G\u00fcnl\u00fck O, Luedtke J (2016) Strengthened benders cuts for stochastic integer programs with continuous recourse. INFORMS J Comput 29(1):77\u201391","journal-title":"INFORMS J Comput"},{"issue":"6","key":"321_CR5","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1287\/inte.1060.0252","volume":"36","author":"G Brown","year":"2006","unstructured":"Brown G, Carlyle M, Salmer\u00f3n J, Wood K (2006) Defending critical infrastructure. Interfaces 36(6):530\u2013544","journal-title":"Interfaces"},{"issue":"4","key":"321_CR6","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1287\/opre.1080.0643","volume":"57","author":"GG Brown","year":"2009","unstructured":"Brown GG, Carlyle WM, Harney RC, Skroch EM, Wood RK (2009) Interdicting a nuclear-weapons project. Oper Res 57(4):866\u2013877","journal-title":"Oper Res"},{"issue":"2","key":"321_CR7","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/opre.46.2.184","volume":"46","author":"KJ Cormican","year":"1998","unstructured":"Cormican KJ, Morton DP, Wood RK (1998) Stochastic network interdiction. Oper Res 46(2):184\u2013197","journal-title":"Oper Res"},{"issue":"1","key":"321_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10479-009-0677-2","volume":"187","author":"NB Dimitrov","year":"2011","unstructured":"Dimitrov NB, Michalopoulos DP, Morton DP, Nehme MV, Pan F, Popova E, Schneider EA, Thoreson GG (2011) Network deployment of radiation detectors with physics-based detection probability calculations. Ann Oper Res 187(1):207\u2013228","journal-title":"Ann Oper Res"},{"issue":"14","key":"321_CR9","first-page":"17","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet R (1960) Applications de l\u2019alg\u00e8bre de Boole en recherche op\u00e9rationelle. Rev Fr d\u2019Inform et de Rech Op\u00e9r 4(14):17\u201325","journal-title":"Rev Fr d\u2019Inform et de Rech Op\u00e9r"},{"issue":"1","key":"321_CR10","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"DR Fulkerson","year":"1977","unstructured":"Fulkerson DR, Harding GC (1977) Maximizing the minimum source-sink path subject to a budget constraint. Math Program 13(1):116\u2013118","journal-title":"Math Program"},{"issue":"4","key":"321_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1002\/nav.3800250412","volume":"25","author":"B Golden","year":"1978","unstructured":"Golden B (1978) A problem in network interdiction. Nav Res Logist Q 25(4):711\u2013713","journal-title":"Nav Res Logist Q"},{"key":"321_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/0-306-48109-X_4","volume-title":"Network interdiction and stochastic integer programming","author":"R Hemmecke","year":"2003","unstructured":"Hemmecke R, Schultz R, Woodruff DL (2003) Interdicting stochastic networks with binary interdiction effort. In: Woodruff DL (ed) Network interdiction and stochastic integer programming. Springer, Berlin, pp 69\u201384"},{"issue":"3","key":"321_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1002\/net.20237","volume":"52","author":"U Janjarassuk","year":"2008","unstructured":"Janjarassuk U, Linderoth J (2008) Reformulation and sampling to solve a stochastic network interdiction problem. Networks 52(3):120\u2013132","journal-title":"Networks"},{"issue":"2","key":"321_CR14","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1287\/ijoc.2014.0623","volume":"27","author":"M Lubin","year":"2015","unstructured":"Lubin M, Dunning I (2015) Computing in operations research using Julia. INFORMS J Comput 27(2):238\u2013248","journal-title":"INFORMS J Comput"},{"issue":"1","key":"321_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick GP (1976) Computability of global solutions to factorable nonconvex programs: part I\u2014convex underestimating problems. Math Program 10(1):147\u2013175","journal-title":"Math Program"},{"key":"321_CR16","volume-title":"Wiley encyclopedia of operations research and management science","author":"DP Morton","year":"2011","unstructured":"Morton DP (2011) Stochastic network interdiction. In: Cochran JJ (ed) Wiley encyclopedia of operations research and management science. Wiley, Hoboken"},{"issue":"1","key":"321_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/07408170500488956","volume":"39","author":"DP Morton","year":"2007","unstructured":"Morton DP, Pan F, Saeger KJ (2007) Models for nuclear smuggling interdiction. IIE Trans 39(1):3\u201314","journal-title":"IIE Trans"},{"key":"321_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York"},{"issue":"1","key":"321_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions\u2014I. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"issue":"3","key":"321_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/net.20238","volume":"52","author":"F Pan","year":"2008","unstructured":"Pan F, Morton DP (2008) Minimizing a stochastic maximum-reliability path. Networks 52(3):111\u2013119","journal-title":"Networks"},{"key":"321_CR21","first-page":"1","volume-title":"Network interdiction and stochastic integer programming","author":"F Pan","year":"2003","unstructured":"Pan F, Charlton WS, Morton DP (2003) A stochastic program for interdicting smuggled nuclear material. In: Woodruff DL (ed) Network interdiction and stochastic integer programming. Springer, Berlin, pp 1\u201319"},{"key":"321_CR22","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrivjer","year":"2003","unstructured":"Schrivjer A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin"},{"issue":"6","key":"321_CR23","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1287\/opre.12.6.934","volume":"12","author":"R Wollmer","year":"1964","unstructured":"Wollmer R (1964) Removing arcs from a network. Oper Res 12(6):934\u2013940","journal-title":"Oper Res"},{"issue":"2","key":"321_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"RK Wood","year":"1993","unstructured":"Wood RK (1993) Deterministic network interdiction. Math Comput Model 17(2):1\u201318","journal-title":"Math Comput Model"},{"issue":"1\u20132","key":"321_CR25","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-016-1033-3","volume":"162","author":"J Yu","year":"2017","unstructured":"Yu J, Ahmed S (2017) Maximizing a class of submodular utility functions with constraints. Math Program 162(1\u20132):145\u2013164","journal-title":"Math Program"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-018-0321-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-018-0321-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-018-0321-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T06:25:23Z","timestamp":1693722323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-018-0321-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,16]]},"references-count":25,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["321"],"URL":"https:\/\/doi.org\/10.1007\/s10287-018-0321-1","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,16]]},"assertion":[{"value":"14 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}