{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:07:59Z","timestamp":1750219679951,"version":"3.41.0"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T00:00:00Z","timestamp":1722038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T00:00:00Z","timestamp":1722038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-20-1-2242"],"award-info":[{"award-number":["N00014-20-1-2242"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-23-1-0742"],"award-info":[{"award-number":["FA9550-23-1-0742"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10107-024-02111-1","type":"journal-article","created":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T06:02:36Z","timestamp":1722060156000},"page":"437-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On supervalid inequalities for binary interdiction games"],"prefix":"10.1007","volume":"212","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2045-0979","authenticated-orcid":false,"given":"Ningji","family":"Wei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8258-7532","authenticated-orcid":false,"given":"Jose L.","family":"Walteros","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"issue":"1\u20133","key":"2111_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2003.10.019","volume":"282","author":"E Algaba","year":"2004","unstructured":"Algaba, E., Bilbao, J.M., van den Brink, R., Jim\u00e9nez-Losada, A.: Cooperative games on antimatroids. Discret. Math. 282(1\u20133), 1\u201315 (2004)","journal-title":"Discret. Math."},{"issue":"7","key":"2111_CR2","doi-asserted-by":"crossref","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A Arulselvan","year":"2009","unstructured":"Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36(7), 2193\u20132200 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2111_CR3","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1287\/opre.2020.2014","volume":"69","author":"A Baggio","year":"2021","unstructured":"Baggio, A., Carvalho, M., Lodi, A., Tramontani, A.: Multilevel approaches for the critical node problem. Oper. Res. 69(2), 486\u2013508 (2021)","journal-title":"Oper. Res."},{"issue":"2","key":"2111_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(89)90003-5","volume":"8","author":"MO Ball","year":"1989","unstructured":"Ball, M.O., Golden, B.L., Vohra, R.V.: Finding the most vital arcs in a network. Oper. Res. Lett. 8(2), 73\u201376 (1989)","journal-title":"Oper. Res. Lett."},{"key":"2111_CR5","volume-title":"Practical bilevel optimization: algorithms and applications","author":"JF Bard","year":"2013","unstructured":"Bard, J.F.: Practical bilevel optimization: algorithms and applications, vol. 30. Springer Science & Business Media, Cham (2013)"},{"issue":"1","key":"2111_CR6","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1006\/aama.1998.0583","volume":"21","author":"M Barnabei","year":"1998","unstructured":"Barnabei, M., Nicoletti, G., Pezzoli, L.: Matroids on partially ordered sets. Adv. Appl. Math. 21(1), 78\u2013112 (1998)","journal-title":"Adv. Appl. Math."},{"issue":"12","key":"2111_CR7","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1080\/24725854.2019.1597316","volume":"51","author":"NO Baycik","year":"2019","unstructured":"Baycik, N.O., Sullivan, K.M.: Robust location of hidden interdictions on a shortest path network. IISE Trans. 51(12), 1332\u20131347 (2019)","journal-title":"IISE Trans."},{"issue":"17","key":"2111_CR8","doi-asserted-by":"crossref","first-page":"1933","DOI":"10.1016\/j.dam.2011.06.023","volume":"159","author":"C Bazgan","year":"2011","unstructured":"Bazgan, C., Toubaline, S., Tuza, Z.: The most vital nodes with respect to independent set and vertex cover. Discret. Appl. Math. 159(17), 1933\u20131946 (2011)","journal-title":"Discret. Appl. Math."},{"issue":"17","key":"2111_CR9","doi-asserted-by":"crossref","first-page":"1933","DOI":"10.1016\/j.dam.2011.06.023","volume":"159","author":"C Bazgan","year":"2011","unstructured":"Bazgan, C., Toubaline, S., Tuza, Z.: The most vital nodes with respect to independent set and vertex cover. Discret. Appl. Math. 159(17), 1933\u20131946 (2011)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"2111_CR10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10878-011-9449-4","volume":"26","author":"C Bazgan","year":"2013","unstructured":"Bazgan, C., Toubaline, S., Vanderpooten, D.: Critical edges\/nodes for the minimum spanning tree problem: complexity and approximation. J. Comb. Optim. 26(1), 178\u2013189 (2013)","journal-title":"J. Comb. Optim."},{"key":"2111_CR11","volume-title":"Matroid Applications, Encyclopedia of Mathematics and its Applications","author":"A Bj\u00f6rner","year":"1992","unstructured":"Bj\u00f6rner, A., Ziegler, G.M.: Introduction to Greedoids. In: White, N. (ed.) Matroid Applications, Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1992)"},{"issue":"1","key":"2111_CR12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/deca.2015.0325","volume":"13","author":"JS Borrero","year":"2016","unstructured":"Borrero, J.S., Prokopyev, O.A., Saur\u00e9, D.: Sequential shortest path interdiction with incomplete information. Decis. Anal. 13(1), 68\u201398 (2016)","journal-title":"Decis. Anal."},{"issue":"1","key":"2111_CR13","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/trsc.1100.0340","volume":"45","author":"P Cappanera","year":"2011","unstructured":"Cappanera, P., Scaparra, M.P.: Optimal allocation of protective resources in shortest-path networks. Transp. Sci. 45(1), 64\u201380 (2011)","journal-title":"Transp. Sci."},{"issue":"2","key":"2111_CR14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/ijoc.2015.0676","volume":"28","author":"A Caprara","year":"2016","unstructured":"Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: Bilevel knapsack with interdiction constraints. INFORMS J. Comput. 28(2), 319\u2013333 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"2111_CR15","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1287\/ijoc.2021.1085","volume":"34","author":"C Contardo","year":"2022","unstructured":"Contardo, C., Sefair, J.A.: A progressive approximation approach for the exact solution of sparse large-scale binary interdiction games. INFORMS J. Comput. 34(2), 890\u2013908 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"2111_CR16","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/opre.46.2.184","volume":"46","author":"KJ Cormican","year":"1998","unstructured":"Cormican, K.J., Morton, D.P., Wood, R.K.: Stochastic network interdiction. Oper. Res. 46(2), 184\u2013197 (1998)","journal-title":"Oper. Res."},{"key":"2111_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-52119-6","volume-title":"Bilevel Optimization","author":"S Dempe","year":"2020","unstructured":"Dempe, S., Zemkoho, A.: Bilevel Optimization. Springer, Cham (2020)"},{"issue":"3","key":"2111_CR18","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1007\/s10589-012-9458-y","volume":"53","author":"M Di Summa","year":"2012","unstructured":"Di Summa, M., Grosso, A., Locatelli, M.: Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. 53(3), 649\u2013680 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2111_CR19","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1109\/TNET.2011.2170849","volume":"20","author":"TN Dinh","year":"2012","unstructured":"Dinh, T.N., Xuan, Y., Thai, M.T., Pardalos, P.M., Znati, T.: On new approaches of assessing network vulnerability: hardness and approximation. IEEE\/ACM Trans. Netw. 20(2), 609\u2013619 (2012)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"2111_CR20","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"2111_CR21","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/ijoc.2018.0831","volume":"31","author":"M Fischetti","year":"2019","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: Interdiction games and monotonicity, with application to knapsack problems. INFORMS J. Comput. 31(2), 390\u2013410 (2019)","journal-title":"INFORMS J. Comput."},{"key":"2111_CR22","unstructured":"Frederickson, G.\u00a0N., Solis-Oba, R.: Increasing the weight of minimum spanning trees. In Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms, pp. 539\u2013546. Society for Industrial and Applied Mathematics (1996)"},{"issue":"1","key":"2111_CR23","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.ejor.2019.02.028","volume":"277","author":"F Furini","year":"2019","unstructured":"Furini, F., Ljubi\u0107, I., Martin, S., San Segundo, P.: The maximum clique interdiction problem. Eur. J. Operat. Res. 277(1), 112\u2013127 (2019)","journal-title":"Eur. J. Operat. Res."},{"key":"2111_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.01.030","author":"F Furini","year":"2021","unstructured":"Furini, F., Ljubi\u0107, I., San Segundo, P., Zhao, Y.: A branch-and-cut algorithm for the edge interdiction clique problem. Eur. J. Operat. Res. (2021). https:\/\/doi.org\/10.1016\/j.ejor.2021.01.030","journal-title":"Eur. J. Operat. Res."},{"issue":"2","key":"2111_CR25","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","volume":"4","author":"D Gale","year":"1968","unstructured":"Gale, D.: Optimal assignments in an ordered set: an application of matroid theory. J. Combinatorial Theory 4(2), 176\u2013180 (1968)","journal-title":"J. Combinatorial Theory"},{"issue":"1","key":"2111_CR26","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/nav.3800180103","volume":"18","author":"P Ghare","year":"1971","unstructured":"Ghare, P., Montgomery, D.C., Turner, W.: Optimal interdiction policy for a flow network. Naval Res. Logist. Q. 18(1), 37\u201345 (1971)","journal-title":"Naval Res. Logist. Q."},{"issue":"2","key":"2111_CR27","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/moor.17.2.444","volume":"17","author":"P Glasserman","year":"1992","unstructured":"Glasserman, P., Yao, D.D.: Generalized semi-markov processes: antimatroid structure and second-order properties. Math. Oper. Res. 17(2), 444\u2013469 (1992)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2111_CR28","doi-asserted-by":"crossref","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. Logist. (NRL) 64(2), 139\u2013153 (2017)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"4","key":"2111_CR29","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9(4), 551\u2013570 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"2111_CR30","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1177\/0160017607308679","volume":"31","author":"TH Grubesic","year":"2008","unstructured":"Grubesic, T.H., Matisziw, T.C., Murray, A.T., Snediker, D.: Comparative approaches for assessing network vulnerability. Int. Reg. Sci. Rev. 31(1), 88\u2013112 (2008)","journal-title":"Int. Reg. Sci. Rev."},{"issue":"4","key":"2111_CR31","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/bltj.10093","volume":"8","author":"DJ Houck","year":"2004","unstructured":"Houck, D.J., Kim, E., O\u2019Reilly, G.P., Picklesimer, D.D., Uzunalioglu, H.: A network survivability model for critical national infrastructures. Bell Labs Tech. J. 8(4), 153\u2013172 (2004)","journal-title":"Bell Labs Tech. J."},{"issue":"2","key":"2111_CR32","first-page":"97","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli, E., Wood, R.K.: Shortest-path network interdiction. Netw. Int. J. 40(2), 97\u2013111 (2002)","journal-title":"Netw. Int. J."},{"issue":"7","key":"2111_CR33","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/j.tra.2005.11.003","volume":"40","author":"E Jenelius","year":"2006","unstructured":"Jenelius, E., Petersen, T., Mattsson, L.-G.: Importance and exposure in road network vulnerability analysis. Transp. Res. Part A Policy Pract. 40(7), 537\u2013560 (2006)","journal-title":"Transp. Res. Part A Policy Pract."},{"issue":"2","key":"2111_CR34","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1109\/TEM.2016.2542849","volume":"63","author":"A Kheirkhah","year":"2016","unstructured":"Kheirkhah, A., Navidi, H., Bidgoli, M.M.: An improved benders decomposition algorithm for an arc interdiction vehicle routing problem. IEEE Trans. Eng. Manag. 63(2), 259\u2013273 (2016)","journal-title":"IEEE Trans. Eng. Manag."},{"key":"2111_CR35","doi-asserted-by":"crossref","unstructured":"Kleinert, T., Labb\u00e9, M., Ljubi\u0107, I., Schmidt, M.: A survey on mixed-integer programming techniques in bilevel optimization. Available at http:\/\/www.optimization-online.org\/DB_HTML\/2021\/01\/8187.html. Last access, May 2021., (2021)","DOI":"10.1016\/j.ejco.2021.100007"},{"key":"2111_CR36","volume-title":"Greedoids","author":"B Korte","year":"2012","unstructured":"Korte, B., Lov\u00e1sz, L., Schrader, R.: Greedoids, vol. 4. Springer Science & Business Media, Cham (2012)"},{"issue":"1","key":"2111_CR37","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/07408170600729192","volume":"39","author":"C Lim","year":"2007","unstructured":"Lim, C., Smith, J.C.: Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Trans. 39(1), 15\u201326 (2007)","journal-title":"IIE Trans."},{"issue":"2","key":"2111_CR38","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.ejor.2020.10.002","volume":"291","author":"S Liu","year":"2021","unstructured":"Liu, S., Wang, M., Kong, N., Hu, X.: An enhanced branch-and-bound algorithm for bilevel integer linear programming. Eur. J. Oper. Res. 291(2), 661\u2013679 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2111_CR39","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/ijoc.2016.0721","volume":"29","author":"L Lozano","year":"2016","unstructured":"Lozano, L., Smith, J.C.: A backward sampling framework for interdiction problems with fortification. INFORMS J. Comput. 29(1), 123\u2013139 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"2111_CR40","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"2111_CR41","first-page":"503","volume":"7","author":"TL Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. Handb. Oper. Res. Manag. Sci. 7, 503\u2013615 (1995)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"2111_CR42","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10479-019-03315-x","volume":"294","author":"F Mahdavi Pajouh","year":"2020","unstructured":"Mahdavi Pajouh, F.: Minimum cost edge blocker clique problem. Ann. Oper. Res. 294, 345\u2013376 (2020)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2111_CR43","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.21556","volume":"64","author":"F Mahdavi Pajouh","year":"2014","unstructured":"Mahdavi Pajouh, F., Boginski, V., Pasiliao, E.L.: Minimum vertex blocker clique problem. Networks 64(1), 48\u201364 (2014)","journal-title":"Networks"},{"key":"2111_CR44","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cor.2007.09.004","volume":"36","author":"TC Matisziw","year":"2009","unstructured":"Matisziw, T.C., Murray, A.T.: Modeling $$s$$-$$t$$ path availability to support disaster vulnerability assessment of network infrastructure. Comput. Oper. Res. 36, 16\u201326 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2111_CR45","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/nav.3800170302","volume":"17","author":"AW McMasters","year":"1970","unstructured":"McMasters, A.W., Mustin, T.M.: Optimal interdiction of a supply network. Naval Res. Logist. Q. 17(3), 261\u2013268 (1970)","journal-title":"Naval Res. Logist. Q."},{"issue":"1","key":"2111_CR46","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.ejor.2015.05.037","volume":"247","author":"FM Pajouh","year":"2015","unstructured":"Pajouh, F.M., Walteros, J.L., Boginski, V., Pasiliao, E.L.: Minimum edge blocker dominating set problem. Eur. J. Oper. Res. 247(1), 16\u201326 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"2111_CR47","volume-title":"Matroid Theory and its Applications in Electric Network Theory and in Statics","author":"A Recski","year":"2013","unstructured":"Recski, A.: Matroid Theory and its Applications in Electric Network Theory and in Statics, vol. 6. Springer Science & Business Media, Cham (2013)"},{"issue":"1","key":"2111_CR48","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. i. Excluding a forest. J. Combinatorial Theory Ser. B 35(1), 39\u201361 (1983)","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"1","key":"2111_CR49","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.20458","volume":"60","author":"J Salmer\u00f3n","year":"2012","unstructured":"Salmer\u00f3n, J.: Deception tactics for network interdiction: a multiobjective approach. Networks 60(1), 45\u201358 (2012)","journal-title":"Networks"},{"issue":"2","key":"2111_CR50","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/TPWRS.2004.825888","volume":"19","author":"J Salmeron","year":"2004","unstructured":"Salmeron, J., Wood, K., Baldick, R.: Analysis of electric grid security under terrorist threat. IEEE Trans. Power Syst. 19(2), 905\u2013912 (2004)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"2111_CR51","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/TPWRS.2004.825888","volume":"19","author":"J Salmeron","year":"2004","unstructured":"Salmeron, J., Wood, K.R., Baldick, R.: Analysis of electric grid security under terrorist threat. IEEE Trans. Power Syst. 19(2), 905\u2013912 (2004)","journal-title":"IEEE Trans. Power Syst."},{"issue":"4","key":"2111_CR52","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.21712","volume":"68","author":"JA Sefair","year":"2016","unstructured":"Sefair, J.A., Smith, J.C.: Dynamic shortest-path interdiction. Networks 68(4), 315\u2013330 (2016)","journal-title":"Networks"},{"issue":"3","key":"2111_CR53","doi-asserted-by":"crossref","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":"4","key":"2111_CR54","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM (JACM) 44(4), 585\u2013591 (1997)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"2111_CR55","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.ejor.2016.01.003","volume":"252","author":"L Taccari","year":"2016","unstructured":"Taccari, L.: Integer programming formulations for the elementary shortest path problem. Eur. J. Oper. Res. 252(1), 122\u2013130 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"2111_CR56","doi-asserted-by":"crossref","first-page":"2634","DOI":"10.1287\/ijoc.2022.1196","volume":"34","author":"K Tan\u0131nm\u0131\u015f","year":"2022","unstructured":"Tan\u0131nm\u0131\u015f, K., Sinnl, M.: A branch-and-cut algorithm for submodular interdiction games. INFORMS J. Comput. 34(5), 2634\u20132657 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"2111_CR57","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1080\/10020070612330019","volume":"16","author":"Z Tao","year":"2005","unstructured":"Tao, Z., Zhongqian, F., Binghong, W.: Epidemic dynamics on complex networks. Prog. Nat. Sci. 16(5), 452\u2013457 (2005)","journal-title":"Prog. Nat. Sci."},{"issue":"3","key":"2111_CR58","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9947-1959-0101527-3","volume":"90","author":"WT Tutte","year":"1959","unstructured":"Tutte, W.T.: Matroids and graphs. Trans. Am. Math. Soc. 90(3), 527\u2013552 (1959)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"2111_CR59","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, K.: Two-person zero-sum games for network interdiction. Oper. Res. 43(2), 243\u2013251 (1995)","journal-title":"Oper. Res."},{"issue":"2","key":"2111_CR60","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.ejor.2022.01.009","volume":"302","author":"N Wei","year":"2022","unstructured":"Wei, N., Walteros, J.L.: Integer programming methods for solving binary interdiction games. Eur. J. Oper. Res. 302(2), 456 (2022)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2111_CR61","first-page":"1461","volume":"33","author":"N Wei","year":"2021","unstructured":"Wei, N., Walteros, J.L., Pajouh, F.M.: Integer programming formulations for minimum spanning tree interdiction. INFORMS J. Comput. 33(4), 1461\u20131480 (2021)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"2111_CR62","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1007\/s11590-021-01717-0","volume":"15","author":"N Wei","year":"2021","unstructured":"Wei, N., Walteros, J.L., Worden, M.R., Ortiz-Pe\u00f1a, H.J.: A resiliency analysis of information distribution policies over mobile ad hoc networks. Optim. Lett. 15(4), 1081\u20131103 (2021)","journal-title":"Optim. Lett."},{"key":"2111_CR63","volume-title":"Integer and Combinatorial Optimization","author":"LA Wolsey","year":"1999","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization, vol. 55. Wiley, London (1999)"},{"issue":"2","key":"2111_CR64","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R Wood","year":"1993","unstructured":"Wood, R.: Deterministic network interdiction. Math. Comput. Model. 17(2), 1\u201318 (1993)","journal-title":"Math. Comput. Model."},{"key":"2111_CR65","doi-asserted-by":"crossref","unstructured":"Xie, X., Aros-Vera, F.: An interdependent network interdiction model for disrupting sex trafficking networks. Prod. Oper. Manag. (2022)","DOI":"10.1111\/poms.13713"},{"key":"2111_CR66","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.cor.2013.07.016","volume":"41","author":"P Xu","year":"2014","unstructured":"Xu, P., Wang, L.: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions. Comput. Oper. Res. 41, 309\u2013318 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2111_CR67","first-page":"218","volume":"18","author":"J Yang","year":"2021","unstructured":"Yang, J., Borrero, J.S., Prokopyev, O.A., Saur\u00e9, D.: Sequential shortest path interdiction with incomplete information and limited feedback. Decis. Anal. 18(3), 218\u2013244 (2021)","journal-title":"Decis. Anal."},{"issue":"15","key":"2111_CR68","doi-asserted-by":"crossref","first-page":"1676","DOI":"10.1016\/j.dam.2010.06.006","volume":"158","author":"R Zenklusen","year":"2010","unstructured":"Zenklusen, R.: Matching interdiction. Discrete Appl. Math. 158(15), 1676\u20131690 (2010)","journal-title":"Discrete Appl. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02111-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02111-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02111-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:03:12Z","timestamp":1750176192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02111-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,27]]},"references-count":68,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2111"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02111-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,7,27]]},"assertion":[{"value":"7 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}