{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T17:15:45Z","timestamp":1764350145635},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,18]],"date-time":"2012-04-18T00:00:00Z","timestamp":1334707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10479-012-1135-0","type":"journal-article","created":{"date-parts":[[2012,4,17]],"date-time":"2012-04-17T13:59:20Z","timestamp":1334671160000},"page":"411-442","source":"Crossref","is-referenced-by-count":18,"title":["Network interdiction to minimize the maximum probability of evasion with synergy between applied resources"],"prefix":"10.1007","volume":"196","author":[{"given":"Brian J.","family":"Lunday","sequence":"first","affiliation":[]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,18]]},"reference":[{"issue":"3","key":"1135_CR1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.orl.2005.05.002","volume":"34","author":"M. D. Bailey","year":"2006","unstructured":"Bailey, M. D., Shechter, S. M., & Schaefer, A. J. (2006). SPAR: stochastic programming with adversarial recourse. Operations Research Letters, 34(3), 307\u2013315.","journal-title":"Operations Research Letters"},{"issue":"3","key":"1135_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/net.20236","volume":"52","author":"H. Bayrak","year":"2008","unstructured":"Bayrak, H., & Bailey, M. (2008). Shortest path network interdiction with asymmetric information. Networks, 52(3), 133\u2013140.","journal-title":"Networks"},{"key":"1135_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471787779","volume-title":"Nonlinear programming: theory and algorithms","author":"M. S. Bazaraa","year":"2006","unstructured":"Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (2006). Nonlinear programming: theory and algorithms (3rd ed.). Hoboken: Wiley.","edition":"3"},{"issue":"6","key":"1135_CR4","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1287\/opre.28.6.1275","volume":"28","author":"S. S. Brown","year":"1980","unstructured":"Brown, S. S. (1980). Optimal search for a moving target in discrete time and space. Operations Research, 28(6), 1275\u20131289.","journal-title":"Operations Research"},{"issue":"6","key":"1135_CR5","doi-asserted-by":"crossref","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, R. K. (2006). Defending critical infrastructure. Interfaces, 36(6), 530\u2013544.","journal-title":"Interfaces"},{"issue":"4","key":"1135_CR6","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1287\/opre.1080.0643","volume":"57","author":"G. G. Brown","year":"2009","unstructured":"Brown, G. G., Harney, R. C., Skroch, E. M., & Wood, R. K. (2009). Interdicting a nuclear-weapons project. Operations Research, 57(4), 866\u2013877.","journal-title":"Operations Research"},{"key":"1135_CR7","unstructured":"Cormican, K. J. (1995). Computational methods for deterministic and stochastic network interdiction problems. Master\u2019s Thesis, US Naval Postgraduate School, Monterey, CA."},{"issue":"2","key":"1135_CR8","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/opre.46.2.184","volume":"46","author":"K. J. Cormican","year":"1998","unstructured":"Cormican, K. J., Morton, D. P., & Wood, R. K. (1998). Stochastic network interdiction. Operations Research, 46(2), 184\u2013197.","journal-title":"Operations Research"},{"key":"1135_CR9","volume-title":"Foundations of bilevel programming","author":"S. Dempe","year":"2002","unstructured":"Dempe, S. (2002). Foundations of bilevel programming. Dordrecht: Kluwer Academic."},{"key":"1135_CR10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L. R. Ford","year":"1956","unstructured":"Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8, 399\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"1135_CR11","unstructured":"Ford, L. R., & Fulkerson, D. R. (1955). A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Project rand research memorandum, RM-1604, Santa Monica, CA."},{"issue":"1","key":"1135_CR12","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"D. R. Fulkerson","year":"1977","unstructured":"Fulkerson, D. R., & Harding, G. C. (1977). Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming, 13(1), 116\u2013118.","journal-title":"Mathematical Programming"},{"issue":"4","key":"1135_CR13","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1002\/nav.3800250412","volume":"25","author":"B. Golden","year":"1978","unstructured":"Golden, B. (1978). A problem in network interdiction. Naval Research Logistics Quarterly, 25(4), 711\u2013713.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"7","key":"1135_CR14","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1080\/0740817X.2010.541178","volume":"43","author":"K. Hausken","year":"2011","unstructured":"Hausken, K. (2011). Strategic defense and attack of series systems when agents move sequentially. IIE Transactions, 43(7), 483\u2013504.","journal-title":"IIE Transactions"},{"issue":"4","key":"1135_CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1002\/nav.20079","volume":"52","author":"H. Held","year":"2005","unstructured":"Held, H., Hemmecke, R., & Woodruff, D. L. (2005). A decomposition algorithm applied to planning the interdiction of stochastic networks. Naval Research Logistics, 52(4), 321\u2013328.","journal-title":"Naval Research Logistics"},{"key":"1135_CR16","doi-asserted-by":"crossref","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, D. L. (2003). Interdicting stochastic networks with binary effort. In D. L. Woodruff (Ed.), Network interdiction and stochastic integer programming (pp.\u00a069\u201384). Norwell: Kluwer Academic."},{"issue":"2","key":"1135_CR17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E. Israeli","year":"2002","unstructured":"Israeli, E., & Wood, R. K. (2002). Shortest-path network interdiction. Networks, 40(2), 97\u2013111.","journal-title":"Networks"},{"key":"1135_CR18","doi-asserted-by":"crossref","first-page":"527","DOI":"10.2307\/2320580","volume":"86","author":"B. O. Koopman","year":"1979","unstructured":"Koopman, B. O. (1979). Search and its optimization. The American Mathematical Monthly, 86, 527\u2013540.","journal-title":"The American Mathematical Monthly"},{"key":"1135_CR19","first-page":"609","volume-title":"Pareto optimality, game theory and equilibria","author":"C. Lim","year":"2008","unstructured":"Lim, C., & Smith, J. C. (2008). Algorithms for network interdiction and fortification games. In A. Chinchuluun, P. M. Pardalos, A. Migdalas, & L. Pitsoulis (Eds.), Pareto optimality, game theory and equilibria (pp.\u00a0609\u2013644). New York: Springer."},{"issue":"1","key":"1135_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/07408170600729192","volume":"39","author":"C. Lim","year":"2007","unstructured":"Lim, C., & Smith, J. C. (2007). Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions, 39(1), 15\u201326.","journal-title":"IIE Transactions"},{"key":"1135_CR21","unstructured":"Lunday, B. J. (2010). Resource allocation on networks: nested event tree optimization, network interdiction, and game theoretic methods. Doctoral Dissertation, Virginia Tech, Blacksburg, VA."},{"issue":"4","key":"1135_CR22","doi-asserted-by":"crossref","first-page":"553","DOI":"10.15388\/Informatica.2010.305","volume":"21","author":"B. J. Lunday","year":"2011","unstructured":"Lunday, B. J., & Sherali, H. D. (2011a). A dynamic network interdiction problem. Informatica, 21(4), 553\u2013574.","journal-title":"Informatica"},{"key":"1135_CR23","unstructured":"Lunday, B. J., & Sherali, H. D. (2011b). Network flow interdiction models and algorithms with resource synergy considerations. Manuscript, Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA."},{"issue":"4","key":"1135_CR24","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1080\/00420980500060384","volume":"42","author":"E. Meijers","year":"2005","unstructured":"Meijers, E. (2005). Polycentric urban regions and the quest for synergy: is a network of cities more than the sum of the parts? Urban Studies, 42(4), 765\u2013781.","journal-title":"Urban Studies"},{"issue":"1","key":"1135_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/07408170500488956","volume":"39","author":"D. P. Morton","year":"2007","unstructured":"Morton, D. P., Pan, F., & Saeger, K. J. (2007). Models for nuclear smuggling interdiction. IIE Transactions, 39(1), 3\u201314.","journal-title":"IIE Transactions"},{"key":"1135_CR26","volume-title":"Groups: theory and experiences","author":"R. W. Napier","year":"1993","unstructured":"Napier, R. W., & Gershenfeld, M. K. (1993). Groups: theory and experiences. Boston: Houghton Mifflin Company."},{"key":"1135_CR27","series-title":"Lecture notes in economics and mathematical systems","first-page":"51","volume-title":"Multiple criteria decision making for sustainable energy and transportation systems. Proceedings of the 19th international conference on multiple criteria decision making","author":"A. Nagurney","year":"2010","unstructured":"Nagurney, A., & Woolley, T. (2010). Environmental and cost synergy in supply chain network integration in mergers and acquisitions. In M. Ehrgott, B. Naujoks, T. Stewart, & J. Wallenius (Eds.) Lecture notes in economics and mathematical systems: Vol.\u00a0634. Multiple criteria decision making for sustainable energy and transportation systems. Proceedings of the 19th international conference on multiple criteria decision making (pp. 51\u201378). Berlin: Springer."},{"key":"1135_CR28","unstructured":"Nehme, M. V. (2009). Two-person games for stochastic network interdiction: models, methods, and complexities. Doctoral Dissertation, University of Texas, Austin, TX."},{"key":"1135_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/0-306-48109-X_1","volume-title":"Network interdiction and stochastic integer programming","author":"F. Pan","year":"2003","unstructured":"Pan, F., Charlton, W. S., & Morton, D. P. (2003). A stochastic program for interdicting smuggled nuclear material. In D. L. Woodruff (Ed.), Network interdiction and stochastic integer programming (pp. 1\u201319). Norwell: Kluwer Academic."},{"issue":"2","key":"1135_CR30","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.1060.0191","volume":"19","author":"J. O. Royset","year":"2007","unstructured":"Royset, J. O., & Wood, R. K. (2007). Solving the bi-objective maximum-flow network-interdiction problem. INFORMS Journal on Computing, 19(2), 175\u2013184.","journal-title":"INFORMS Journal on Computing"},{"key":"1135_CR31","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.tre.2010.09.005","volume":"47","author":"H. D. Sherali","year":"2010","unstructured":"Sherali, H. D., & Lunday, B. J. (2010). Equitable apportionment of railcars within a pooling agreement for shipping automobiles. Transportation Research. Part E, 47, 263\u2013283.","journal-title":"Transportation Research. Part E"},{"key":"1135_CR32","unstructured":"Unsal, O. (2010). Two-person zero-sum network-interdiction game with multiple inspector types. Master\u2019s Thesis, Naval Postgraduate School, Monterey, CA."},{"issue":"3","key":"1135_CR33","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/016502598384261","volume":"22","author":"A. Eye von","year":"1998","unstructured":"von Eye, A., Schuster, C., & Rogers, W. M. (1998). Modelling synergy using manifest categorical variables. International Journal of Behavioral Development, 22(3), 537\u2013557.","journal-title":"International Journal of Behavioral Development"},{"issue":"2","key":"1135_CR34","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/opre.43.2.243","volume":"43","author":"A. Washburn","year":"1995","unstructured":"Washburn, A., & Wood, R. K. (1995). Two-person zero-sum games for network interdiction. Operations Research, 43(2), 243\u2013251.","journal-title":"Operations Research"},{"issue":"2","key":"1135_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R. K. Wood","year":"1993","unstructured":"Wood, R. K. (1993). Deterministic network interdiction. Mathematical and Computer Modelling, 17(2), 1\u201318.","journal-title":"Mathematical and Computer Modelling"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1135-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1135-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1135-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T01:13:15Z","timestamp":1593997995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1135-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,18]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1135"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1135-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,18]]}}}