{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T12:23:30Z","timestamp":1770985410711,"version":"3.50.1"},"reference-count":94,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T00:00:00Z","timestamp":1617148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T00:00:00Z","timestamp":1617148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s40314-021-01453-2","type":"journal-article","created":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T07:03:08Z","timestamp":1617174188000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A bi-level model and memetic algorithm for arc interdiction location-routing problem"],"prefix":"10.1007","volume":"40","author":[{"given":"Ali","family":"Nadizadeh","sequence":"first","affiliation":[]},{"given":"Ali","family":"Sabzevari Zadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,31]]},"reference":[{"issue":"4","key":"1453_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.cie.2013.04.014","volume":"65","author":"M Afshari Rad","year":"2013","unstructured":"Afshari Rad M, Kakhki HT (2013) Maximum dynamic network flow interdiction problem: new formulation and solution procedures. Comput Ind Eng 65(4):531\u2013536","journal-title":"Comput Ind Eng"},{"issue":"2","key":"1453_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ejor.2010.12.011","volume":"211","author":"\u0130 Akg\u00fcn","year":"2011","unstructured":"Akg\u00fcn \u0130, Tansel B\u00c7, Kevin Wood R (2011) The multi-terminal maximum-flow network-interdiction problem. Eur J Oper Res 211(2):241\u2013251","journal-title":"Eur J Oper Res"},{"issue":"7","key":"1453_CR3","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1016\/j.cor.2011.08.006","volume":"39","author":"D Aksen","year":"2012","unstructured":"Aksen D, Aras N (2012) A bilevel fixed charge location model for facilities under imminent attack. Comput Oper Res 39(7):1364\u20131381","journal-title":"Comput Oper Res"},{"key":"1453_CR4","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.cor.2012.08.013","volume":"41","author":"D Aksen","year":"2014","unstructured":"Aksen D, \u015eeng\u00fcl Akca S, Aras N (2014) A bilevel partial interdiction problem with capacitated facilities and demand outsourcing. Comput Oper Res 41:346\u2013358","journal-title":"Comput Oper Res"},{"key":"1453_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.cor.2015.05.016","volume":"64","author":"N Aliakbarian","year":"2015","unstructured":"Aliakbarian N, Dehghanian F, Salari M (2015) A bi-level programming model for protection of hierarchical facilities under imminent attacks. Comput Oper Res 64:210\u2013224","journal-title":"Comput Oper Res"},{"issue":"2","key":"1453_CR6","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1007\/s40314-016-0410-0","volume":"37","author":"M Alinaghian","year":"2018","unstructured":"Alinaghian M, Ghazanfari M, Hamedani SG (2018) A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment. Comput Appl Math 37(2):1680\u20131702","journal-title":"Comput Appl Math"},{"issue":"1","key":"1453_CR7","first-page":"1","volume":"38","author":"DS Altner","year":"2009","unstructured":"Altner DS, Uhan NA (2009) The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability. Oper Res 38(1):1\u201312","journal-title":"Oper Res"},{"issue":"4","key":"1453_CR8","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s40314-020-01349-7","volume":"39","author":"A Amini","year":"2020","unstructured":"Amini A, Tavakkoli-Moghaddam R, Ebrahimnejad S (2020) A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds. Comput Appl Math 39(4):318","journal-title":"Comput Appl Math"},{"issue":"2","key":"1453_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0377-2217(91)90253-R","volume":"51","author":"G Anandalingam","year":"1991","unstructured":"Anandalingam G, Apprey V (1991) Multi-level programming and conflict resolution. Eur J Oper Res 51(2):233\u2013247","journal-title":"Eur J Oper Res"},{"key":"1453_CR10","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.cor.2013.02.022","volume":"41","author":"E Angulo","year":"2014","unstructured":"Angulo E, Castillo E, Garc\u00eda-R\u00f3denas R, S\u00e1nchez-Vizca\u00edno J (2014) A continuous bi-level model for the expansion of highway networks. Comput Oper Res 41:262\u2013276","journal-title":"Comput Oper Res"},{"issue":"2","key":"1453_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1111\/j.1539-6924.2005.00595.x","volume":"25","author":"GE Apostolakis","year":"2005","unstructured":"Apostolakis GE, Lemon DM (2005) A screening methodology for the identification and ranking of infrastructure vulnerabilities due to terrorism. Risk Anal 25(2):361\u2013376","journal-title":"Risk Anal"},{"issue":"2","key":"1453_CR12","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1109\/TPWRS.2005.846198","volume":"20","author":"JM Arroyo","year":"2005","unstructured":"Arroyo JM, Galiana FD (2005) On the solution of the bilevel programming formulation of the terrorist threat problem. IEEE Trans Power Syst 20(2):789\u2013797","journal-title":"IEEE Trans Power Syst"},{"issue":"6","key":"1453_CR13","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(6):413\u2013422","journal-title":"Comput Biol Med"},{"key":"1453_CR14","volume-title":"Policy official explains terror war strategy","author":"J Banusiewicz","year":"2004","unstructured":"Banusiewicz J (2004) Policy official explains terror war strategy. American Forces Press Service, Washington, DC"},{"key":"1453_CR15","unstructured":"Barreto S (2003) http:\/\/sweet.us.pt\/_iscf143"},{"issue":"3","key":"1453_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/net.20236","volume":"52","author":"H Bayrak","year":"2008","unstructured":"Bayrak H, Bailey MD (2008) Shortest path network interdiction with asymmetric information. Networks 52(3):133\u2013140","journal-title":"Networks"},{"issue":"4","key":"1453_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0191-2615(88)90006-9","volume":"22","author":"O Ben-Ayed","year":"1988","unstructured":"Ben-Ayed O, Boyce DE, Blair CE (1988) A general bi-level linear programming formulation of the network design problem. Transport Res Part B Methodol 22(4):311\u2013318","journal-title":"Transport Res Part B Methodol"},{"key":"1453_CR18","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.cie.2017.11.019","volume":"115","author":"MM Bidgoli","year":"2018","unstructured":"Bidgoli MM, Kheirkhah A (2018) An arc interdiction vehicle routing problem with information asymmetry. Comput Ind Eng 115:520\u2013531","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1453_CR19","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/s40314-017-0537-7","volume":"37","author":"MF Brondani","year":"2018","unstructured":"Brondani MF, Sausen ATZR, Sausen PS, Binelo MO (2018) Parameter estimation of lithium ion polymer battery mathematical model using genetic algorithm. Comput Appl Math 37(1):296\u2013313","journal-title":"Comput Appl Math"},{"key":"1453_CR20","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jclepro.2014.09.069","volume":"105","author":"J-F Camacho-Vallejo","year":"2015","unstructured":"Camacho-Vallejo J-F, Gonz\u00e1lez-Rodr\u00edguez E, Almaguer FJ, Gonz\u00e1lez-Ram\u00edrez RG (2015) A bi-level optimization model for aid distribution after the occurrence of a disaster. J Clean Prod 105:134\u2013145","journal-title":"J Clean Prod"},{"issue":"3","key":"1453_CR21","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 RL, Scaparra MP, Middleton RS (2004) Identifying critical infrastructure: the median and covering facility interdiction problems. Ann Assoc Am Geogr 94(3):491\u2013502","journal-title":"Ann Assoc Am Geogr"},{"issue":"6","key":"1453_CR22","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1109\/3468.541346","volume":"26","author":"LW Clarke","year":"1996","unstructured":"Clarke LW, Anandalingam G (1996) An integrated system for designing minimum cost survivable telecommunications networks. IEEE Trans Syst Man Cybern Part A Syst Hum 26(6):856\u2013862","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Hum"},{"issue":"3","key":"1453_CR23","doi-asserted-by":"publisher","first-page":"2865","DOI":"10.1016\/j.eswa.2011.08.146","volume":"39","author":"H Derbel","year":"2012","unstructured":"Derbel H, Jarboui B, Hanafi S, Chabchoub H (2012) Genetic algorithm with iterated local search for solving a location-routing problem. Expert Syst Appl 39(3):2865\u20132871","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1453_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.ejor.2014.08.030","volume":"241","author":"M Drexl","year":"2015","unstructured":"Drexl M, Schneider M (2015) A survey of variants and extensions of the location-routing problem. Eur J Oper Res 241(2):283\u2013308","journal-title":"Eur J Oper Res"},{"key":"1453_CR25","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.cor.2012.05.008","volume":"40","author":"JW Escobar","year":"2013","unstructured":"Escobar JW, Linfati R, Toth P (2013) A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Comput Oper Res 40:70\u201379","journal-title":"Comput Oper Res"},{"key":"1453_CR26","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.trb.2014.05.014","volume":"67","author":"JW Escobar","year":"2014","unstructured":"Escobar JW, Rodrigo-Linfati R, Baldoquin MG, Toth P (2014) A granular variable Tabu neighborhood search for the capacitated location-routing problem. Transport Res Part B 67:344\u2013356","journal-title":"Transport Res Part B"},{"key":"1453_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.cie.2018.03.041","volume":"119","author":"S Fazayeli","year":"2018","unstructured":"Fazayeli S, Eydi A, Kamalabadi IN (2018) Location-routing problem in multimodal transportation network with time windows and fuzzy demands: presenting a two-part genetic algorithm. Comput Ind Eng 119:233\u2013246","journal-title":"Comput Ind Eng"},{"key":"1453_CR28","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01584329","volume":"13","author":"D Fulkerson","year":"1977","unstructured":"Fulkerson D, Harding G (1977) Maximizing the minimum source-sink path subject to a budget constraint. Math Program 13:116\u2013118","journal-title":"Math Program"},{"key":"1453_CR29","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/j.omega.2006.05.006","volume":"36","author":"M Garg","year":"2008","unstructured":"Garg M, Smith J (2008) Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios. Omega 36:1057\u20131071","journal-title":"Omega"},{"issue":"1","key":"1453_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/nav.3800180103","volume":"18","author":"PM Ghare","year":"1971","unstructured":"Ghare PM, Montgomery DC, Turner WC (1971) Optimal interdiction policy for a flow network. Nav Res Logist Q 18(1):37\u201345","journal-title":"Nav Res Logist Q"},{"issue":"11","key":"1453_CR31","doi-asserted-by":"publisher","first-page":"2689","DOI":"10.1016\/j.cor.2013.04.016","volume":"40","author":"D Granata","year":"2013","unstructured":"Granata D, Steeger G, Rebennack S (2013) Network interdiction via a critical disruption path: branch-and-price algorithms. Comput Oper Res 40(11):2689\u20132702","journal-title":"Comput Oper Res"},{"issue":"3","key":"1453_CR32","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10287-005-0025-1","volume":"2","author":"ZH G\u00fcm\u00fc\u015f","year":"2005","unstructured":"G\u00fcm\u00fc\u015f ZH, Floudas CA (2005) Global optimization of mixed-integer bilevel programming problems. CMS 2(3):181\u2013212","journal-title":"CMS"},{"key":"1453_CR33","doi-asserted-by":"crossref","unstructured":"Hart WE, Krasnogor N, Smith JE (2005) Memetic evolutionary algorithms. In: Recent advances in memetic algorithms. Springer, Heidelberg","DOI":"10.1007\/3-540-32363-5"},{"issue":"12","key":"1453_CR34","doi-asserted-by":"publisher","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","volume":"39","author":"V Hemmelmayr","year":"2012","unstructured":"Hemmelmayr V, Cordeau J, Crainic T (2012) An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput Oper Res 39(12):3215\u20133228","journal-title":"Comput Oper Res"},{"key":"1453_CR35","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jmsy.2016.10.004","volume":"42","author":"A Hiassat","year":"2017","unstructured":"Hiassat A, Diabat A, Rahwan I (2017) A genetic algorithm approach for location-inventory-routing problem with perishable products. J Manuf Syst 42:93\u2013103","journal-title":"J Manuf Syst"},{"issue":"2","key":"1453_CR36","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97\u2013111","journal-title":"Networks"},{"key":"1453_CR37","doi-asserted-by":"publisher","first-page":"102069","DOI":"10.1016\/j.omega.2019.05.005","volume":"96","author":"Z Jabbarzare","year":"2019","unstructured":"Jabbarzare Z, Zolfagharinia H, Najafi M (2019) Dynamic interdiction networks with applications in illicit supply chains. Omega 96:102069","journal-title":"Omega"},{"issue":"3","key":"1453_CR38","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1016\/j.ejor.2017.10.034","volume":"266","author":"J Jiang","year":"2018","unstructured":"Jiang J, Liu X (2018) Multi-objective Stackelberg game model for water supply networks against interdictions with incomplete information. Eur J Oper Res 266(3):920\u2013933","journal-title":"Eur J Oper Res"},{"key":"1453_CR39","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1016\/j.jclepro.2018.12.197","volume":"213","author":"M Kaboli Chalmardi","year":"2019","unstructured":"Kaboli Chalmardi M, Camacho-Vallejo J-F (2019) A bi-level programming model for sustainable supply chain network design that considers incentives for using cleaner technologies. J Clean Prod 213:1035\u20131050","journal-title":"J Clean Prod"},{"key":"1453_CR40","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.cor.2014.06.009","volume":"55","author":"I Karaoglan","year":"2015","unstructured":"Karaoglan I, Altiparmak F (2015) A memetic algorithm for the capacitated location-routing problem with mixed backhauls. Comput Oper Res 55:200\u2013216","journal-title":"Comput Oper Res"},{"key":"1453_CR41","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1007\/s11590-011-0412-1","volume":"6","author":"S Ke\u00e7ici","year":"2012","unstructured":"Ke\u00e7ici S, Aras N, Verter V (2012) Incorporating the threat of terrorist attacks in the design of public service facility networks. Optim Lett 6:1101\u20131121","journal-title":"Optim Lett"},{"issue":"2","key":"1453_CR42","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1080\/00207543.2015.1084061","volume":"54","author":"A Kheirkhah","year":"2016","unstructured":"Kheirkhah A, Navidi H, Messi Bidgoli M (2016) A bi-level network interdiction model for solving the hazmat routing problem. Int J Prod Res 54(2):459\u2013471","journal-title":"Int J Prod Res"},{"issue":"2","key":"1453_CR43","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0167-6377(92)90065-B","volume":"12","author":"R Kohli","year":"1992","unstructured":"Kohli R, Krishnamurti R (1992) A total-value greedy heuristic for the integer knapsack problem. Oper Res Lett 12(2):65\u201371","journal-title":"Oper Res Lett"},{"issue":"8","key":"1453_CR44","doi-asserted-by":"publisher","first-page":"3905","DOI":"10.1016\/j.apm.2011.02.008","volume":"35","author":"RJ Kuo","year":"2011","unstructured":"Kuo RJ, Han YS (2011) A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem\u2014a case study on supply chain model. Appl Math Model 35(8):3905\u20133917","journal-title":"Appl Math Model"},{"issue":"8","key":"1453_CR45","doi-asserted-by":"publisher","first-page":"9287","DOI":"10.1016\/j.eswa.2011.01.034","volume":"38","author":"H Lan","year":"2011","unstructured":"Lan H, Li R, Liu Z, Wang R (2011) Study on the inventory control of deteriorating items under VMI model based on bi-level programming. Expert Syst Appl 38(8):9287\u20139295","journal-title":"Expert Syst Appl"},{"key":"1453_CR46","first-page":"163","volume-title":"Vehicle routing: methods and studies","author":"G Laporte","year":"1988","unstructured":"Laporte G (1988) Location-routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam, pp 163\u2013198"},{"key":"1453_CR47","unstructured":"Li Z, Tang L, Liu J (2020) A memetic algorithm based on probability learning for solving the multi-dimensional knapsack problem. IEEE Trans Cybern 1\u201316"},{"key":"1453_CR48","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.renene.2020.11.082","volume":"165","author":"J Li","year":"2021","unstructured":"Li J, Lu B, Wang Z, Zhu M (2021) Bi-level optimal planning model for energy storage systems in a virtual power plant. Renew Energy 165:77\u201395","journal-title":"Renew Energy"},{"issue":"1","key":"1453_CR49","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/07408170600729192","volume":"39","author":"C Lim","year":"2007","unstructured":"Lim C, Smith JC (2007) Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Trans 39(1):15\u201326","journal-title":"IIE Trans"},{"key":"1453_CR50","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.cor.2016.01.006","volume":"70","author":"RB Lopes","year":"2016","unstructured":"Lopes RB, Ferreira C, Santos BS (2016) A simple and effective evolutionary algorithm for the capacitated location\u2013routing problem. Comput Oper Res 70:155\u2013162","journal-title":"Comput Oper Res"},{"key":"1453_CR51","doi-asserted-by":"publisher","first-page":"113721","DOI":"10.1016\/j.eswa.2020.113721","volume":"160","author":"Q Luo","year":"2020","unstructured":"Luo Q, Deng Q, Gong G, Zhang L, Han W, Li K (2020) An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers. Expert Syst Appl 160:113721","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1453_CR52","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1109\/TSMCA.2004.826825","volume":"34","author":"H Luss","year":"2004","unstructured":"Luss H, Wong RT (2004) Survivable telecommunications network design under different types of failures. IEEE Trans Syst Man Cybern Part A Syst Hum 34(4):521\u2013530","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Hum"},{"issue":"3","key":"1453_CR53","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/nav.3800170302","volume":"17","author":"AW McMasters","year":"1970","unstructured":"McMasters AW, Mustin TM (1970) Optimal interdiction of a supply network. Nav Res Logist Q 17(3):261\u2013268","journal-title":"Nav Res Logist Q"},{"issue":"1","key":"1453_CR54","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ejor.2013.02.013","volume":"229","author":"YZ Mehrjerdi","year":"2013","unstructured":"Mehrjerdi YZ, Nadizadeh A (2013) Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands. Eur J Oper Res 229(1):75\u201384","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1453_CR55","first-page":"1","volume":"27","author":"YZ Mehrjerdi","year":"2016","unstructured":"Mehrjerdi YZ, Nadizadeh A (2016) Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands. Int J Ind Eng Prod Res 27(1):1\u201319","journal-title":"Int J Ind Eng Prod Res"},{"key":"1453_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(97)00172-0","volume":"108","author":"H Min","year":"1998","unstructured":"Min H, Jayaraman V, Srivastava R (1998) Combined location-routing problems: a synthesis and future research directions. Eur J Oper Res 108:1\u201315","journal-title":"Eur J Oper Res"},{"key":"1453_CR57","doi-asserted-by":"publisher","first-page":"113379","DOI":"10.1016\/j.eswa.2020.113379","volume":"157","author":"JC Molina","year":"2020","unstructured":"Molina JC, Salmeron JL, Eguia I (2020) An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows. Expert Syst Appl 157:113379","journal-title":"Expert Syst Appl"},{"key":"1453_CR58","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1287\/opre.38.5.911","volume":"38","author":"JT Moore","year":"1990","unstructured":"Moore JT, Bard JF (1990) The mixed integer linear bilevel programming problem. Oper Res 38:911\u2013921","journal-title":"Oper Res"},{"issue":"1","key":"1453_CR59","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"},{"issue":"2","key":"1453_CR60","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1023047900333","volume":"26","author":"LD Muu","year":"2003","unstructured":"Muu LD, Quy NV (2003) A global optimization method for solving convex quadratic bilevel programming problems. J Glob Optim 26(2):199\u2013219","journal-title":"J Glob Optim"},{"issue":"3","key":"1453_CR61","first-page":"325","volume":"28","author":"A Nadizadeh","year":"2017","unstructured":"Nadizadeh A (2017) The fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery: formulation and a heuristic algorithm. Int J Ind Eng Prod Res 28(3):325\u2013345","journal-title":"Int J Ind Eng Prod Res"},{"key":"1453_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/19427867.2016.1270798","volume":"11","author":"A Nadizadeh","year":"2017","unstructured":"Nadizadeh A, Kafash B (2017) Fuzzy capacitated location-routing problem with simultaneous pickup and delivery demands. Transport Lett 11:1\u201319","journal-title":"Transport Lett"},{"issue":"2","key":"1453_CR63","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.ejor.2014.04.012","volume":"238","author":"A Nadizadeh","year":"2014","unstructured":"Nadizadeh A, Nasab HH (2014) Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm. Eur J Oper Res 238(2):458\u2013470","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1453_CR64","first-page":"217","volume":"6","author":"A Nadizadeh","year":"2019","unstructured":"Nadizadeh A, Nasab HH (2019) Modelling and solving the capacitated location-routing problem with simultaneous pickup and delivery demands. Int J Transport Eng 6(3):217\u2013235","journal-title":"Int J Transport Eng"},{"issue":"17","key":"1453_CR65","first-page":"7499","volume":"5","author":"A Nadizadeh","year":"2011","unstructured":"Nadizadeh A, Sahraeian R, Sabzevari Zadeh A, Homayouni SM (2011) Using greedy clustering method to solve capacitated location-routing problem. Afr J Bus Manag 5(17):7499\u20137506","journal-title":"Afr J Bus Manag"},{"key":"1453_CR66","first-page":"1","volume":"2014","author":"A Nadizadeh","year":"2014","unstructured":"Nadizadeh A, Nasab HH, Sadeghieh A, Fakhrzad MB (2014) A location-routing problem model with multiple periods and fuzzy demands. J Data Envel Anal Decis Sci 2014:1\u201324","journal-title":"J Data Envel Anal Decis Sci"},{"issue":"1","key":"1453_CR67","first-page":"1","volume":"9","author":"A Nadizadeh","year":"2017","unstructured":"Nadizadeh A, Sadegheih A, Sabzevari Zadeh A (2017) A hybrid heuristic algorithm to solve capacitated location-routing problem with fuzzy demands. Int J Ind Math 9(1):1\u201320","journal-title":"Int J Ind Math"},{"key":"1453_CR68","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G Nagy","year":"2007","unstructured":"Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:649\u2013672","journal-title":"Eur J Oper Res"},{"key":"1453_CR69","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cor.2016.05.005","volume":"75","author":"AK Nandi","year":"2016","unstructured":"Nandi AK, Medal HR, Vadlamani S (2016) Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender\u2013attacker model. Comput Oper Res 75:118\u2013131","journal-title":"Comput Oper Res"},{"issue":"11","key":"1453_CR70","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu SU, Prins C, Wolfler Calvo R (2010) An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput Oper Res 37(11):1877\u20131885","journal-title":"Comput Oper Res"},{"key":"1453_CR71","unstructured":"Pan F (2005) Stochastic network interdiction: models and methods. Doctoral dissertation, The University of Texas at Austin"},{"key":"1453_CR72","first-page":"1","volume":"22","author":"F Pan","year":"2003","unstructured":"Pan F, Charlton WS, Morton DP (2003) A stochastic program for interdicting smuggled nuclear material. Oper Res Comput Sci Interfaces Ser 22:1\u201319","journal-title":"Oper Res Comput Sci Interfaces Ser"},{"issue":"1","key":"1453_CR73","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.01.005","volume":"238","author":"C Prodhon","year":"2014","unstructured":"Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur J Oper Res 238(1):1\u20137","journal-title":"Eur J Oper Res"},{"issue":"8","key":"1453_CR74","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.ress.2010.03.008","volume":"95","author":"JE Ramirez-Marquez","year":"2010","unstructured":"Ramirez-Marquez JE (2010) Bi and tri-objective optimization in the deterministic network interdiction problem. Reliab Eng Syst Saf 95(8):887\u2013896","journal-title":"Reliab Eng Syst Saf"},{"issue":"2","key":"1453_CR75","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.cie.2010.04.004","volume":"59","author":"CMS Rocco","year":"2010","unstructured":"Rocco CMS, Ramirez-Marquez JE (2010) A bi-objective approach for shortest-path network interdiction. Comput Ind Eng 59(2):232\u2013240","journal-title":"Comput Ind Eng"},{"key":"1453_CR76","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 Ind Eng 106:400\u2013411","journal-title":"Comput Ind Eng"},{"key":"1453_CR77","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0377-2217(89)90188-4","volume":"39","author":"S Salhi","year":"1989","unstructured":"Salhi S, Rand GK (1989) The effect of ignoring routes when locating depots. Eur J Oper Res 39:150\u2013156","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1453_CR78","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/TPWRS.2004.825888","volume":"19","author":"J Salmeron","year":"2004","unstructured":"Salmeron J, Wood K, Baldick R (2004) Analysis of electric grid security under terrorist threat. IEEE Trans Power Syst 19(2):905\u2013912","journal-title":"IEEE Trans Power Syst"},{"key":"1453_CR79","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.cie.2016.10.031","volume":"103","author":"S Saranwong","year":"2017","unstructured":"Saranwong S, Likasiri C (2017) Bi-level programming model for solving distribution center problem: a case study in Northern Thailand\u2019s sugarcane management. Comput Ind Eng 103:26\u201339","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1453_CR80","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s40314-016-0362-4","volume":"37","author":"S Shahdi-Pashaki","year":"2018","unstructured":"Shahdi-Pashaki S, Teymourian E, Tavakkoli-Moghaddam R (2018) New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm. Comput Appl Math 37(1):693\u2013718","journal-title":"Comput Appl Math"},{"issue":"3","key":"1453_CR81","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":"1453_CR82","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.apm.2007.02.007","volume":"32","author":"H Sun","year":"2008","unstructured":"Sun H, Gao Z, Wu J (2008) A bi-level programming model and solution algorithm for the location of logistics distribution centers. Appl Math Model 32:610\u2013616","journal-title":"Appl Math Model"},{"key":"1453_CR83","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.trb.2014.05.008","volume":"67","author":"WY Szeto","year":"2014","unstructured":"Szeto WY, Jiang Y (2014) Transit route and frequency design: bi-level modeling and hybrid artificial bee colony algorithm approach. Transport Res Part B Methodol 67:235\u2013263","journal-title":"Transport Res Part B Methodol"},{"issue":"2","key":"1453_CR84","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 (1995) Two-person zero-sum games for network interdiction. Oper Res 43(2):243\u2013251","journal-title":"Oper Res"},{"issue":"4","key":"1453_CR85","first-page":"106","volume":"13","author":"M Wei","year":"2013","unstructured":"Wei M, Sun B, Jin W (2013) A bi-level programming model for uncertain regional bus scheduling problems. J Transport Syst Eng Inf Technol 13(4):106\u2013112","journal-title":"J Transport Syst Eng Inf Technol"},{"key":"1453_CR86","unstructured":"Witt KM (2003) Development of a probabilistic network model to simulate the smuggling of nuclear materials. Nuclear and Radiation Engineering, The University of Texas at Austin. Doctoral dissertation, MS Thesis"},{"issue":"6","key":"1453_CR87","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":"1453_CR88","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"},{"key":"1453_CR89","doi-asserted-by":"publisher","first-page":"106480","DOI":"10.1016\/j.cie.2020.106480","volume":"144","author":"Y Xiang","year":"2020","unstructured":"Xiang Y, Wei H (2020) Joint optimizing network interdiction and emergency facility location in terrorist attacks. Comput Ind Eng 144:106480","journal-title":"Comput Ind Eng"},{"key":"1453_CR90","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.cie.2018.12.054","volume":"128","author":"E Yadegari","year":"2019","unstructured":"Yadegari E, Alem-Tabriz A, Zandieh M (2019) A memetic algorithm with a novel neighborhood search and modified solution representation for closed-loop supply chain network design. Comput Ind Eng 128:418\u2013436","journal-title":"Comput Ind Eng"},{"key":"1453_CR91","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.ress.2019.01.005","volume":"185","author":"AB Yaghlane","year":"2019","unstructured":"Yaghlane AB, Azaiez MN, Mrad M (2019) System survivability in the context of interdiction networks. Reliab Eng Syst Saf 185:362\u2013371","journal-title":"Reliab Eng Syst Saf"},{"issue":"13","key":"1453_CR92","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1016\/j.dam.2010.04.008","volume":"158","author":"R Zenklusen","year":"2010","unstructured":"Zenklusen R (2010) Network flow interdiction on planar graphs. Discrete Appl Math 158(13):1441\u20131455","journal-title":"Discrete Appl Math"},{"key":"1453_CR93","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ress.2017.10.026","volume":"179","author":"J Zhang","year":"2017","unstructured":"Zhang J, Zhuang J, Behlendorf B (2017) Stochastic shortest path network interdiction with a case study of Arizona-Mexico border. Reliab Eng Syst Saf 179:62\u201373","journal-title":"Reliab Eng Syst Saf"},{"key":"1453_CR94","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.trc.2017.09.002","volume":"85","author":"Y Zhu","year":"2017","unstructured":"Zhu Y, Mao B, Bai Y, Chen S (2017) A bi-level model for single-line rail timetable design with consideration of demand and capacity. Transport Res Part C Emerg Technol 85:211\u2013233","journal-title":"Transport Res Part C Emerg Technol"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01453-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-021-01453-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01453-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T00:25:29Z","timestamp":1617927929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-021-01453-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,31]]},"references-count":94,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1453"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01453-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,31]]},"assertion":[{"value":"9 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"100"}}