{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:53Z","timestamp":1740142493762,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T00:00:00Z","timestamp":1695081600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T00:00:00Z","timestamp":1695081600000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s40314-023-02445-0","type":"journal-article","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T16:15:51Z","timestamp":1695140151000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shortest path interdiction problem with convex piecewise-linear costs"],"prefix":"10.1007","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7559-3870","authenticated-orcid":false,"given":"Javad","family":"Tayyebi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian M.","family":"Deaconu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Bigdeli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malihe","family":"Niksirat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,19]]},"reference":[{"key":"2445_CR1","doi-asserted-by":"publisher","first-page":"106708","DOI":"10.1016\/j.cie.2020.106708","volume":"148","author":"A Abdolahzadeh","year":"2020","unstructured":"Abdolahzadeh A, Aman M, Tayyebi J (2020) Minimum st-cut interdiction problem. Comput Indus Eng 148:106708","journal-title":"Comput Indus Eng"},{"issue":"2","key":"2445_CR2","first-page":"205","volume":"12","author":"A Abdolahzadeh","year":"2021","unstructured":"Abdolahzadeh A, Aman M, Tayyebi J (2021) Communication Line Protection Against Sabotages Using Dynamic Minimum Cut Interdiction. J Adv Defense Sci Technol 12(2):205\u2013215 ((in persian))","journal-title":"J Adv Defense Sci Technol"},{"key":"2445_CR3","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, applications and algorithms, Englewood Cliffs, New Jersey, USA Arrow, KJ: Prentice-Hall"},{"key":"2445_CR4","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0010-4825(87)90060-6","volume":"17","author":"N Assimakopoulos","year":"1987","unstructured":"Assimakopoulos N (1987) A network interdiction model for hospital infection control. Comput Biol Med 17:413\u2013422","journal-title":"Comput Biol Med"},{"issue":"3","key":"2445_CR5","first-page":"133","volume":"52","author":"H Bayrak","year":"2008","unstructured":"Bayrak H, Bailey MD (2008) Shortest path network interdiction with asymmetric information. Netw Int J 52(3):133\u2013140","journal-title":"Netw Int J"},{"key":"2445_CR6","volume-title":"Linear programming and network flows","author":"MS Bazaraa","year":"2008","unstructured":"Bazaraa MS, Jarvis JJ, Sherali HD (2008) Linear programming and network flows. Wiley, Hoboken"},{"issue":"1","key":"2445_CR7","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10878-011-9449-4","volume":"26","author":"C Bazgan","year":"2013","unstructured":"Bazgan C, Toubaline S, Vanderpooten D (2013) Critical edges\/nodes for the minimum spanning tree problem: complexity and approximation. J Comb Optim 26(1):178\u2013189","journal-title":"J Comb Optim"},{"key":"2445_CR8","unstructured":"Britannica T Editors of Encyclopaedia (2022, January 9) Persian Gulf War. Encyclopedia Britannica. https:\/\/www.britannica.com\/event\/Persian-Gulf-War. Accessed 2 2023"},{"key":"2445_CR9","doi-asserted-by":"publisher","unstructured":"Boeckmann J, Thielen C (2021) A $$(B+1)$$-approximation for network flow interdiction with unit costs. Discrete Appl Math. https:\/\/doi.org\/10.1016\/j.dam.2021.07.008","DOI":"10.1016\/j.dam.2021.07.008"},{"issue":"1","key":"2445_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1287\/deca.2015.0325","volume":"13","author":"JS Borrero","year":"2016","unstructured":"Borrero JS, Prokopyev OA, Saur\u00e9 D (2016) Sequential shortest path interdiction with incomplete information. Decis Anal 13(1):68\u201398","journal-title":"Decis Anal"},{"issue":"6","key":"2445_CR11","first-page":"530","volume":"36","author":"G Brown","year":"2006","unstructured":"Brown G, Carlyle M, Salmeron J, Wood K (2006) Defending critical infrastructure. Informs 36(6):530\u2013544","journal-title":"Informs"},{"key":"2445_CR12","first-page":"482","volume":"2","author":"P Erd\u00f5s","year":"1976","unstructured":"Erd\u00f5s P, R\u00e9nyi A (1976) On the evolution of random graphs. Selected Papers of Alfr\u00e9d R\u00e9nyi 2:482\u2013525","journal-title":"Selected Papers of Alfr\u00e9d R\u00e9nyi"},{"issue":"1","key":"2445_CR13","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":"2445_CR14","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. Naval Res Logistics Q 25(4):711\u2013713","journal-title":"Naval Res Logistics Q"},{"issue":"2","key":"2445_CR15","first-page":"97","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli E, Wood RK (2002) Shortest-path network interdiction. Netw Int J 40(2):97\u2013111","journal-title":"Netw Int J"},{"key":"2445_CR16","doi-asserted-by":"publisher","first-page":"100007","DOI":"10.1016\/j.ejco.2021.100007","volume":"9","author":"T Kleinert","year":"2021","unstructured":"Kleinert T, Labb\u00e9 M, Ljubi\u0107 I, Schmidt M (2021) A survey on mixed-integer programming techniques in bilevel optimization. EURO J Comput Optimization 9:100007","journal-title":"EURO J Comput Optimization"},{"issue":"5","key":"2445_CR17","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1080\/0740817X.2011.602659","volume":"44","author":"A Malaviya","year":"2012","unstructured":"Malaviya A, Rainwater C, Sharkey TC (2012) Multi-period network interdiction problems with applications to city-level drug enforcement. IIE Trans 44(5):368\u2013380","journal-title":"IIE Trans"},{"key":"2445_CR18","doi-asserted-by":"publisher","first-page":"107708","DOI":"10.1016\/j.cie.2021.107708","volume":"162","author":"M Mirzaei","year":"2021","unstructured":"Mirzaei M, Al-e SMJM, Shirazi MA (2021) A maximum-flow network interdiction problem in an uncertain environment under information asymmetry condition: Application to smuggling goods. Comput Indus Eng 162:107708","journal-title":"Comput Indus Eng"},{"issue":"04","key":"2445_CR19","doi-asserted-by":"publisher","first-page":"1950018","DOI":"10.1142\/S0217595919500180","volume":"36","author":"A Mohammadi","year":"2019","unstructured":"Mohammadi A, Tayyebi J (2019) Maximum capacity path interdiction problem with fixed costs. Asia-Pacific J Oper Res 36(04):1950018","journal-title":"Asia-Pacific J Oper Res"},{"issue":"2","key":"2445_CR20","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.cie.2010.04.004","volume":"59","author":"JE Ramirez-Marquez","year":"2010","unstructured":"Ramirez-Marquez JE (2010) A bi-objective approach for shortest-path network interdiction. Comput Indus Eng 59(2):232\u2013240","journal-title":"Comput Indus Eng"},{"key":"2445_CR21","doi-asserted-by":"publisher","first-page":"104996","DOI":"10.1016\/j.cor.2020.104996","volume":"123","author":"MEH Sadati","year":"2020","unstructured":"Sadati MEH, Aksen D, Aras N (2020) A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection. Comput Operat Res 123:104996","journal-title":"Comput Operat Res"},{"key":"2445_CR22","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.cie.2017.02.006","volume":"106","author":"S Sadeghi","year":"2017","unstructured":"Sadeghi S, Seifi A, Azizi E (2017) Trilevel shortest path network interdiction with partial fortification. Comput Indus Eng 106:400\u2013411","journal-title":"Comput Indus Eng"},{"key":"2445_CR23","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer LE, Dietz T, Natale MV, Ruzika S, Krumke SO, Fonseca CM (2020) The Bicriterion Maximum Flow Network Interdiction Problem in s-t-Planar Graphs. In: Operations Research Proceedings 2019 (pp 133-139). Springer, Cham","DOI":"10.1007\/978-3-030-48439-2_16"},{"issue":"4","key":"2445_CR24","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/net.21712","volume":"68","author":"JA Sefair","year":"2016","unstructured":"Sefair JA, Smith JC (2016) Dynamic shortest-path interdiction. Networks 68(4):315\u2013330","journal-title":"Networks"},{"key":"2445_CR25","doi-asserted-by":"crossref","unstructured":"Smith JC, Lim C (2008) Algorithms for network interdiction and fortification games. In: Pareto optimality, game theory and equilibria (pp 609-644). Springer, New York","DOI":"10.1007\/978-0-387-77247-9_24"},{"issue":"3","key":"2445_CR26","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2019.06.024","volume":"283","author":"JC Smith","year":"2020","unstructured":"Smith JC, Song Y (2020) A survey of network interdiction models and algorithms. Eur J Oper Res 283(3):797\u2013811","journal-title":"Eur J Oper Res"},{"key":"2445_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39415-8","volume-title":"Linear programming","author":"RJ Vanderbei","year":"2020","unstructured":"Vanderbei RJ (2020) Linear programming. Springer International Publishing, New York"},{"key":"2445_CR28","doi-asserted-by":"crossref","unstructured":"Washburn A (2014) Two-Person Zero-Sum Games. International Series in Operations Research and Management Science, Springer, The fourth edition","DOI":"10.1007\/978-1-4614-9050-0"},{"issue":"4","key":"2445_CR29","first-page":"1461","volume":"33","author":"N Wei","year":"2021","unstructured":"Wei N, Walteros JL, Pajouh FM (2021) Integer programming formulations for minimum spanning tree interdiction. INFORMS J Comput 33(4):1461\u20131480","journal-title":"INFORMS J Comput"},{"key":"2445_CR30","doi-asserted-by":"publisher","first-page":"146535","DOI":"10.1109\/ACCESS.2020.3012963","volume":"8","author":"K Xiao","year":"2020","unstructured":"Xiao K, Zhu C, Zhang W, Wei X (2020) The Bi-Objective Shortest Path Network Interdiction Problem: Subgraph Algorithm and Saturation Property. IEEE Access 8:146535\u2013146547","journal-title":"IEEE Access"},{"issue":"3","key":"2445_CR31","first-page":"218","volume":"18","author":"J Yang","year":"2021","unstructured":"Yang J, Borrero JS, Prokopyev OA, Saur\u00e9 (2021) Sequential shortest path interdiction with incomplete information and limited feedback. Decis Anal 18(3):218\u2013244","journal-title":"Decis Anal"},{"issue":"4","key":"2445_CR32","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s10898-020-00958-0","volume":"79","author":"Q Zhang","year":"2021","unstructured":"Zhang Q, Guan X, Pardalos PM (2021) Maximum shortest path interdiction problem by upgrading edges on trees under weighted $$l_1$$ norm. J Global Optim 79(4):959\u2013987","journal-title":"J Global Optim"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02445-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02445-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02445-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T03:48:43Z","timestamp":1696564123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02445-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,19]]},"references-count":32,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["2445"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02445-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2023,9,19]]},"assertion":[{"value":"6 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"309"}}