{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T21:41:53Z","timestamp":1760305313343,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032080660"},{"type":"electronic","value":"9783032080677"}],"license":[{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-08067-7_6","type":"book-chapter","created":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:37:19Z","timestamp":1760301439000},"page":"103-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Contested Route Planning"],"prefix":"10.1007","author":[{"given":"Jakub","family":"\u010cern\u00fd","sequence":"first","affiliation":[]},{"given":"Garud","family":"Iyengar","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Kroer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,13]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.cor.2012.10.002","volume":"40","author":"A Agra","year":"2013","unstructured":"Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L.M., Poss, M., Requejo, C.: The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3), 856\u2013866 (2013)","journal-title":"Comput. Oper. Res."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.cie.2017.10.030","volume":"115","author":"KA Alotaibi","year":"2018","unstructured":"Alotaibi, K.A., Rosenberger, J.M., Mattingly, S.P., Punugu, R.K., Visoldilokpun, S.: Unmanned aerial vehicle routing in the presence of threats. Comput. Ind. Eng. 115, 190\u2013205 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"An, B., Tambe, M., Sinha, A.: Stackelberg security games (SSG) basics and application overview. Improving Homel. Secur. Decisions p.\u00a0485 (2017)","DOI":"10.1017\/9781316676714.021"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Barahona, F., et\u00a0al.: Inventory allocation and transportation scheduling for logistics of network-centric military operations. IBM J. Res. Dev. 51(3.4), 391\u2013407 (2007)","DOI":"10.1147\/rd.513.0391"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bast, H., et al.: Route planning in transportation networks. Algorithm engineering: Selected results and surveys, pp. 19\u201380 (2016)","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"6_CR6","unstructured":"Beaumont, P.: Ukraine attacks key russian held bridge in kherson (2022). https:\/\/www.theguardian.com\/world\/live\/2022\/jul\/27\/russia-ukraine-live-news-ukraine-attacks-key-kherson-bridge-in-bid-to-isolate-russian-forces, Accessed 05 Jun 2025"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bell, J.E., Griffis, S.E.: Military applications of location analysis. Applications location analysis, pp. 403\u2013433 (2015)","DOI":"10.1007\/978-3-319-20282-2_17"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.cie.2017.11.019","volume":"115","author":"MM Bidgoli","year":"2018","unstructured":"Bidgoli, M.M., Kheirkhah, A.: An arc interdiction vehicle routing problem with information asymmetry. Comput. Ind. Eng. 115, 520\u2013531 (2018)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1177\/1548512918798056","volume":"17","author":"M Blom","year":"2020","unstructured":"Blom, M., Shekh, S., Gossink, D., Miller, T., Pearce, A.R.: Inventory routing for defense: moving supplies in adversarial and partially observable environments. J. Defense Modeling Simul. 17(1), 55\u201381 (2020)","journal-title":"J. Defense Modeling Simul."},{"key":"6_CR10","unstructured":"Boidot, E., Marzuoli, A., Feron, E.: A complete framework for ambush avoidance in realistic environments. arXiv preprint arXiv:1408.6127 (2014)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Bonato, A.: The game of cops and robbers on graphs. Am. Math. Soc. (2011)","DOI":"10.1090\/stml\/061"},{"issue":"6","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1109\/TRO.2008.2006721","volume":"24","author":"SD Bopardikar","year":"2008","unstructured":"Bopardikar, S.D., Bullo, F., Hespanha, J.P.: On discrete-time pursuit-evasion games with sensing limitations. IEEE Trans. Rob. 24(6), 1429\u20131439 (2008)","journal-title":"IEEE Trans. Rob."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"\u010cern\u00fd, J., et al.: Contested logistics: a game-theoretic approach. In: International Conference on Decision and Game Theory for Security, pp. 124\u2013146. Springer (2024)","DOI":"10.1007\/978-3-031-74835-6_7"},{"key":"6_CR14","unstructured":"\u010cern\u00fd, J., Ling, C.K., Kroer, C., Iyengar, G.: Layered graph security games. In: Proceedings of the Thirty-third International Joint Conference on Artificial Intelligence, IJCAI-24. International Joint Conferences on Artificial Intelligence Organization (2024)"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73(2), 129\u2013174 (1996)","journal-title":"Math. Program."},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1111\/j.1467-8306.2004.00410.x","volume":"94","author":"RL Church","year":"2004","unstructured":"Church, R.L., Scaparra, M.P., Middleton, R.S.: Identifying critical infrastructure: the median and covering facility interdiction problems. Ann. Assoc. Am. Geogr. 94(3), 491\u2013502 (2004)","journal-title":"Ann. Assoc. Am. Geogr."},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1080\/00045601003794908","volume":"100","author":"D Cowen","year":"2010","unstructured":"Cowen, D.: A geography of logistics: market authority and the security of supply chains. Ann. Assoc. Am. Geogr. 100(3), 600\u2013620 (2010)","journal-title":"Ann. Assoc. Am. Geogr."},{"key":"6_CR18","unstructured":"Daganzo, C.: Logistics systems analysis. Springer Science and Business Media (2005)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Algorithmics of large and complex networks: design, analysis, and simulation, pp. 117\u2013139. Springer (2009)","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Edsger Wybe Dijkstra: his life, work, and legacy, pp. 287\u2013290 (2022)","DOI":"10.1145\/3544585.3544600"},{"key":"6_CR21","unstructured":"Friedman, A.: Differential games. Courier Corporation (2013)"},{"key":"6_CR22","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, vol.\u00a029. wh freeman New York (2002)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Ghiani, G., Laporte, G., Musmanno, R.: Introduction to logistics systems planning and control. John Wiley and Sons (2004)","DOI":"10.1002\/0470014040"},{"key":"6_CR24","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: SODA. vol.\u00a05, pp. 156\u2013165 (2005)"},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/nav.21738","volume":"64","author":"N Goldberg","year":"2017","unstructured":"Goldberg, N.: Non-zero-sum nonlinear network path interdiction with an application to inspection in terror networks. Naval Res. Logistics (NRL) 64(2), 139\u2013153 (2017)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE trans. Syst. Sci. Cybern."},{"key":"6_CR27","unstructured":"Hill, R., Pohl, E.: An overview of meta-heuristics and their use in military modeling. Handb. Mil. Ind. Eng. (2009)"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","volume":"10","author":"Q Huangfu","year":"2018","unstructured":"Huangfu, Q., Hall, J.J.: Parallelizing the dual revised simplex method. Math. Program. Comput. 10(1), 119\u2013142 (2018)","journal-title":"Math. Program. Comput."},{"key":"6_CR29","unstructured":"Huntington, T.: Bombing burmas bridges (2021). https:\/\/warfarehistorynetwork.com\/article\/bombing-burmas-bridges\/, Accessed 05 Jun 2025"},{"key":"6_CR30","unstructured":"Isaacs, R.: Differential games: a mathematical theory with applications to warfare and pursuit, control and optimization. Courier Corporation (1999)"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Israeli, E., Wood, R.K.: Shortest-path network interdiction. Netw. Int. J. 40(2), 97\u2013111 (2002)","DOI":"10.1002\/net.10039"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Jain, M., An, B., Tambe, M.: Security games applied to real-world: research contributions and challenges. In: Moving Target Defense II: Application of Game Theory and Adversarial Modeling. pp. 15\u201339. Springer (2013)","DOI":"10.1007\/978-1-4614-5416-8_2"},{"key":"6_CR33","unstructured":"Jain, M., Korzhyk, D., Van\u011bk, O., Conitzer, V., P\u011bchou\u010dek, M., Tambe, M.: A double oracle algorithm for zero-sum security games on graphs. In: The 10th International Conference on Autonomous Agents and Multiagent Systems-Volume 1, pp. 327\u2013334. Citeseer (2011)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Korzhyk, D., Conitzer, V., Parr, R.: Complexity of computing optimal stackelberg strategies in security resource allocation games. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol.\u00a024, pp. 805\u2013810 (2010)","DOI":"10.1609\/aaai.v24i1.7638"},{"key":"6_CR35","unstructured":"Krever, N., \u010cern\u1ef3, J., Blanchard, M., Kroer, C.: Guard: Constructing realistic two-player matrix and security games for benchmarking game-theoretic algorithms. arXiv preprint arXiv:2505.14547 (2025)"},{"issue":"9","key":"6_CR36","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1057\/jors.2011.136","volume":"63","author":"C Lee","year":"2012","unstructured":"Lee, C., Lee, K., Park, S.: Robust vehicle routing problem with deadlines and travel time\/demand uncertainty. J. Oper. Res. Soc. 63(9), 1294\u20131306 (2012)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Lee, J.M.y., Wong, E.Y.c.: Suez canal blockage: an analysis of legal impact, risks and liabilities to the global supply chain. In: MATEC web of conferences. vol.\u00a0339, p. 01019. EDP Sciences (2021)","DOI":"10.1051\/matecconf\/202133901019"},{"key":"6_CR38","volume-title":"Knapsack problems: algorithms comput. implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack problems: algorithms comput. implementations. John Wiley and Sons, Inc (1990)"},{"issue":"3","key":"6_CR39","first-page":"14","volume":"70","author":"CJ McMahon","year":"2017","unstructured":"McMahon, C.J.: Maritime trade warfare: a strategy for the twenty-first century? Naval War Coll. Rev. 70(3), 14\u201338 (2017)","journal-title":"Naval War Coll. Rev."},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"v.\u00a0Neumann, J.: Zur theorie der gesellschaftsspiele. Math. Ann. 100(1), 295\u2013320 (1928)","DOI":"10.1007\/BF01448847"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Ord\u00f3\u00f1ez, F.: Robust vehicle routing. In: Risk and optimization in an uncertain world, pp. 153\u2013178. INFORMS (2010)","DOI":"10.1287\/educ.1100.0078"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs: Proceedings, Michigan May 11\u201315, 1976, pp. 426\u2013441. Springer (2006)","DOI":"10.1007\/BFb0070400"},{"key":"6_CR43","volume-title":"Logistics systems","author":"HC Pfohl","year":"1998","unstructured":"Pfohl, H.C.: Logistics systems. The faculty of ILiM, Pozna\u0144 (1998)"},{"issue":"5","key":"6_CR44","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D Pisinger","year":"1997","unstructured":"Pisinger, D.: A minimal algorithm for the 0\u20131 knapsack problem. Oper. Res. 45(5), 758\u2013767 (1997)","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"6_CR45","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(98)00127-9","volume":"89","author":"D Pisinger","year":"1998","unstructured":"Pisinger, D.: A fast algorithm for strongly correlated knapsack problems. Discret. Appl. Math. 89(1\u20133), 197\u2013212 (1998)","journal-title":"Discret. Appl. Math."},{"key":"6_CR46","unstructured":"Pita, J., et al.: Armor security for los angeles international airport. In: AAAI. pp. 1884\u20131885 (2008)"},{"issue":"2","key":"6_CR47","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/opre.24.2.314","volume":"24","author":"W Ruckle","year":"1976","unstructured":"Ruckle, W., Fennell, R., Holmes, P.T., Fennemore, C.: Ambushing random walks i: Finite models. Oper. Res. 24(2), 314\u2013324 (1976)","journal-title":"Oper. Res."},{"issue":"2","key":"6_CR48","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1111\/itor.12669","volume":"27","author":"MEH Sadati","year":"2020","unstructured":"Sadati, M.E.H., Aksen, D., Aras, N.: The r-interdiction selective multi-depot vehicle routing problem. Int. Trans. Oper. Res. 27(2), 835\u2013866 (2020)","journal-title":"Int. Trans. Oper. Res."},{"key":"6_CR49","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12198-010-0037-0","volume":"3","author":"M Salani","year":"2010","unstructured":"Salani, M., Duyckaerts, G., Swartz, P.G.: Ambush avoidance in vehicle routing for valuable delivery. J. Transp. Secur. 3, 41\u201355 (2010)","journal-title":"J. Transp. Secur."},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Salmeron, J., Wood, R.K., Morton, D.P.: A stochastic program for optimizing military sealift subject to attack. Mil. Oper. Res. pp. 19\u201339 (2009)","DOI":"10.5711\/morj.14.2.19"},{"key":"6_CR51","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley and Sons (1998)"},{"key":"6_CR52","unstructured":"Shieh, E., et al.: Protect: a deployed game theoretic system to protect the ports of the united states. In: Proceedings of the 11th international conference on autonomous agents and multiagent systems-volume 1, pp. 13\u201320 (2012)"},{"key":"6_CR53","doi-asserted-by":"crossref","unstructured":"Smith, J.C., Lim, C.: Algorithms for network interdiction and fortification games. Pareto optimality, game theory and equilibria pp. 609\u2013644 (2008)","DOI":"10.1007\/978-0-387-77247-9_24"},{"issue":"3","key":"6_CR54","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2019.06.024","volume":"283","author":"JC Smith","year":"2020","unstructured":"Smith, J.C., Song, Y.: A survey of network interdiction models and algorithms. Eur. J. Oper. Res. 283(3), 797\u2013811 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"6_CR55","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1080\/07408170701745378","volume":"40","author":"I Sungur","year":"2008","unstructured":"Sungur, I., Ord\u00f3nez, F., Dessouky, M.: A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans. 40(5), 509\u2013523 (2008)","journal-title":"IIE Trans."},{"issue":"2","key":"6_CR56","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1287\/opre.43.2.243","volume":"43","author":"A Washburn","year":"1995","unstructured":"Washburn, A., Wood, K.: Two-person zero-sum games for network interdiction. Oper. Res. 43(2), 243\u2013251 (1995)","journal-title":"Oper. Res."},{"key":"6_CR57","doi-asserted-by":"crossref","unstructured":"Weintraub, I.E., Pachter, M., Garcia, E.: An introduction to pursuit-evasion differential games. In: 2020 American Control Conference (ACC), pp. 1049\u20131066. IEEE (2020)","DOI":"10.23919\/ACC45564.2020.9147205"},{"issue":"6","key":"6_CR58","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1287\/opre.12.6.934","volume":"12","author":"R Wollmer","year":"1964","unstructured":"Wollmer, R.: Removing arcs from a network. Oper. Res. 12(6), 934\u2013940 (1964)","journal-title":"Oper. Res."},{"key":"6_CR59","doi-asserted-by":"crossref","unstructured":"Xu, H.: The mysteries of security games: Equilibrium computation becomes combinatorial algorithm design. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 497\u2013514 (2016)","DOI":"10.1145\/2940716.2940796"},{"key":"6_CR60","unstructured":"Yaneva, M., Marinov, P., Alexandru-Bucur, R.: Kpym: A c++ knapsack problem solver (2020). https:\/\/github.com\/radualexandrub\/knapsack-library. Accessed 09 Jun 2025"},{"key":"6_CR61","doi-asserted-by":"crossref","unstructured":"Zhang, Y., An, B., Tran-Thanh, L., Wang, Z., Gan, J., Jennings, N.R.: Optimal escape interdiction on transportation networks (2017)","DOI":"10.24963\/ijcai.2017\/550"}],"container-title":["Lecture Notes in Computer Science","Game Theory and AI for Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08067-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T21:02:58Z","timestamp":1760302978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08067-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,13]]},"ISBN":["9783032080660","9783032080677"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08067-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,13]]},"assertion":[{"value":"13 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GameSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Game Theory and AI for Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.gamesec-conf.org\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}