{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T06:13:58Z","timestamp":1782454438861,"version":"3.54.5"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T00:00:00Z","timestamp":1670457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T00:00:00Z","timestamp":1670457600000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s12532-022-00227-z","type":"journal-article","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T12:02:51Z","timestamp":1670500971000},"page":"1-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds"],"prefix":"10.1007","volume":"15","author":[{"given":"Xueyu","family":"Shi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ted K.","family":"Ralphs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,8]]},"reference":[{"issue":"1","key":"227_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153(1), 235\u2013256 (2007)","journal-title":"Ann. Oper. Res."},{"key":"227_CR2","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"5","key":"227_CR3","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1287\/opre.38.5.911","volume":"38","author":"JT Moore","year":"1990","unstructured":"Moore, J.T., Bard, J.F.: The mixed integer linear bilevel programming problem. Oper. Res. 38(5), 911\u2013921 (1990)","journal-title":"Oper. Res."},{"issue":"3","key":"227_CR4","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1287\/opre.2017.1589","volume":"65","author":"L Lozano","year":"2017","unstructured":"Lozano, L., Smith, J.C.: A value-function-based exact approach for the bilevel mixed-integer programming problem. Oper. Res. 65(3), 768\u2013786 (2017)","journal-title":"Oper. Res."},{"issue":"4","key":"227_CR5","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s12532-020-00183-6","volume":"12","author":"S Tahernejad","year":"2020","unstructured":"Tahernejad, S., Ralphs, T.K., DeNegre, S.T.: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Math. Program. Comput. 12(4), 529\u2013568 (2020)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"227_CR6","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1137\/15M1051592","volume":"27","author":"L Wang","year":"2017","unstructured":"Wang, L., Xu, P.: The watermelon algorithm for the bilevel integer linear programming problem. SIAM J. Optim. 27(3), 1403\u20131430 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"227_CR7","doi-asserted-by":"publisher","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."},{"issue":"1\u20132","key":"227_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10107-017-1189-5","volume":"172","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: On the use of intersection cuts for bilevel optimization. Math. Program. 172(1\u20132), 77\u2013103 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"227_CR9","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TEVC.2017.2712906","volume":"22","author":"A Sinha","year":"2017","unstructured":"Sinha, A., Malo, P., Deb, K.: A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans. Evol. Comput. 22(2), 276\u2013295 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"227_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BF02275351","volume":"89","author":"L Vicente","year":"1996","unstructured":"Vicente, L., Savard, G., Judice, J.: Discrete linear bilevel programming problem. J. Optim. Theory Appl. 89(3), 597\u2013614 (1996)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"227_CR11","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1287\/opre.2018.1773","volume":"67","author":"JS Borrero","year":"2019","unstructured":"Borrero, J.S., Prokopyev, O.A., Saur\u00e9, D.: Sequential interdiction with incomplete information and learning. Oper. Res. 67(1), 72\u201389 (2019)","journal-title":"Oper. Res."},{"key":"227_CR12","unstructured":"De Negre, S.: Interdiction and discrete bilevel linear programming. Ph.D. thesis, Lehigh University (2011)"},{"issue":"2","key":"227_CR13","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":"4","key":"227_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/trsc.35.4.345.10433","volume":"35","author":"L Brotcorne","year":"2001","unstructured":"Brotcorne, L., Labb\u00e9, M., Marcotte, P., Savard, G.: A bilevel model for toll optimization on a multicommodity transportation network. Transp. Sci. 35(4), 345\u2013358 (2001)","journal-title":"Transp. Sci."},{"issue":"12\u2013part\u20131","key":"227_CR15","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1287\/mnsc.44.12.1608","volume":"44","author":"M Labb\u00e9","year":"1998","unstructured":"Labb\u00e9, M., Marcotte, P., Savard, G.: A bilevel model of taxation and its application to optimal highway pricing. Manag. Sci. 44(12\u2013part\u20131), 1608\u20131622 (1998)","journal-title":"Manag. Sci."},{"issue":"1","key":"227_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10589-015-9799-4","volume":"64","author":"B Beheshti","year":"2016","unstructured":"Beheshti, B., Prokopyev, O.A., Pasiliao, E.L.: Exact solution approaches for bilevel assignment problems. Comput. Optim. Appl. 64(1), 215\u2013242 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"227_CR17","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.trb.2004.06.004","volume":"39","author":"Z Gao","year":"2005","unstructured":"Gao, Z., Wu, J., Sun, H.: Solution algorithm for the bi-level discrete network design problem. Transport. Res. Part B Methodol. 39(6), 479\u2013495 (2005)","journal-title":"Transport. Res. Part B Methodol."},{"key":"227_CR18","unstructured":"Xu, H., Zhang, Y., Cassandras, C.G., Li, L., Feng, S.: A bi-level cooperative driving strategy allowing lane changes. arXiv preprint arXiv:1912.11495 (2019). https:\/\/arxiv.org\/abs\/1912.11495. Accessed 9 Apr 2020"},{"issue":"2","key":"227_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022645805569","volume":"93","author":"C Audet","year":"1997","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: Links between linear bilevel and mixed 0\u20131 programming problems. J. Optim. Theory Appl. 93(2), 273\u2013300 (1997)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20132","key":"227_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10479-017-2694-x","volume":"272","author":"MH Zare","year":"2019","unstructured":"Zare, M.H., Borrero, J.S., Zeng, B., Prokopyev, O.A.: A note on linearized reformulations for a class of bilevel linear integer problems. Ann. Oper. Res. 272(1\u20132), 99\u2013117 (2019)","journal-title":"Ann. Oper. Res."},{"key":"227_CR21","unstructured":"Zeng, B., An, Y.: Solving bilevel mixed integer program by reformulations and decomposition. Optimization online (2014). http:\/\/www.optimization-online.org\/DB_FILE\/2014\/07\/4455.pdf. Accessed 9 Apr 2020"},{"key":"227_CR22","unstructured":"Tahernejad, S., Ralphs, T.K.: Valid inequalities for mixed integer bilevel optimization problems. COR@L Laboratory Report 20T-013 (2020). https:\/\/coral.ise.lehigh.edu\/~ted\/files\/papers\/MibSCuts20. Accessed 7 June 2021"},{"issue":"2","key":"227_CR23","doi-asserted-by":"publisher","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."},{"key":"227_CR24","doi-asserted-by":"crossref","unstructured":"IBM: ILOG CPLEX Optimization Studio (12.8) (2017). https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio. Accessed 9 Apr 2020","DOI":"10.1007\/978-3-662-62185-1_2"},{"issue":"2","key":"227_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10898-015-0274-7","volume":"66","author":"Y Tang","year":"2016","unstructured":"Tang, Y., Richard, J.P.P., Smith, J.C.: A class of algorithms for mixed-integer bilevel min-max optimization. J. Global Optim. 66(2), 225\u2013262 (2016)","journal-title":"J. Global Optim."},{"key":"227_CR26","doi-asserted-by":"crossref","unstructured":"Della\u00a0Croce, F., Scatamacchia, R.: An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. Math. Program. (to appear) (2020)","DOI":"10.1007\/978-3-030-17953-3_12"},{"key":"227_CR27","volume-title":"Coding and Information Theory","author":"RW Hamming","year":"1986","unstructured":"Hamming, R.W.: Coding and Information Theory. Prentice-Hall Inc. (1986)"},{"key":"227_CR28","doi-asserted-by":"publisher","DOI":"10.1515\/9780691187563","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"2003","unstructured":"Aarts, E., Aarts, E.H., Lenstra, J.K.: Local Search in Combinatorial Optimization. Princeton University Press, Princeton (2003)"},{"issue":"6","key":"227_CR29","doi-asserted-by":"publisher","first-page":"1998","DOI":"10.1137\/S0097539793251244","volume":"28","author":"B Chandra","year":"1999","unstructured":"Chandra, B., Karloff, H., Tovey, C.: New results on the old k-opt algorithm for the traveling salesman problem. SIAM J. Comput. 28(6), 1998\u20132029 (1999)","journal-title":"SIAM J. Comput."},{"key":"227_CR30","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G Gutin","year":"2004","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations, vol. 12. Kluwer Academic Publishers, New York (2004)"},{"issue":"1","key":"227_CR31","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp. Sci. 39(1), 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"issue":"4","key":"227_CR32","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0377-2217(83)90099-1","volume":"13","author":"HN Psaraftis","year":"1983","unstructured":"Psaraftis, H.N.: k-interchange procedures for local search in a precedence-constrained routing problem. Eur. J. Oper. Res. 13(4), 391\u2013402 (1983)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"227_CR33","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"MW Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.W.: Local search in routing problems with time windows. Ann. Oper. Res. 4(1), 285\u2013305 (1985)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"227_CR34","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ipl.2005.05.010","volume":"95","author":"K Katayama","year":"2005","unstructured":"Katayama, K., Hamamoto, A., Narihisa, H.: An effective local search for the maximum clique problem. Inf. Process. Lett. 95(5), 503\u2013511 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"227_CR35","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"227_CR36","unstructured":"Maheswaran, R.T., Pearce, J.P., Tambe, M.: Distributed algorithms for dcop: a graphical-game-based approach. In: ISCA PDCS, pp. 432\u2013439 (2004)"},{"issue":"1","key":"227_CR37","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"AA Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A.: Simple local search problems that are hard to solve. SIAM J. Comput. 20(1), 56\u201387 (1991)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"227_CR38","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s101070000154.","volume":"89","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.: The mixed vertex packing problem. Math. Program. 89(1), 35\u201353 (2000)","journal-title":"Math. Program."},{"issue":"3","key":"227_CR39","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck, O., Pochet, Y.: Mixing mixed-integer inequalities. Math. Program. 90(3), 429\u2013457 (2001)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"227_CR40","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-016-1103-6","volume":"166","author":"M Zhao","year":"2017","unstructured":"Zhao, M., Huang, K., Zeng, B.: A polyhedral study on chance constrained program with random right-hand side. Math. Program. 166(1\u20132), 19\u201364 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"227_CR41","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10898-006-9067-3","volume":"38","author":"JC Smith","year":"2007","unstructured":"Smith, J.C., Lim, C., Sudargho, F.: Survivable network design under optimal and heuristic interdiction scenarios. J. Global Optim. 38(2), 181\u2013199 (2007)","journal-title":"J. Global Optim."},{"issue":"1","key":"227_CR42","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/deca.2019.0392","volume":"17","author":"MH Zare","year":"2020","unstructured":"Zare, M.H., Prokopyev, O.A., Saur\u00e9, D.: On bilevel optimization with inexact follower. Decis. Anal. 17(1), 74\u201395 (2020)","journal-title":"Decis. Anal."},{"issue":"2","key":"227_CR43","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Math. Program. 32(2), 146\u2013164 (1985)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"227_CR44","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10107-013-0700-x","volume":"146","author":"A Lodi","year":"2014","unstructured":"Lodi, A., Ralphs, T.K., Woeginger, G.J.: Bilevel programming and the separation problem. Math. Program. 146(1\u20132), 437\u2013458 (2014)","journal-title":"Math. Program."},{"key":"227_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Global Optimization","author":"R Horst","year":"2000","unstructured":"Horst, R., Pardalos, P.M., Van Thoai, N.: Introduction to Global Optimization. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"2","key":"227_CR46","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"122","author":"J Luedtke","year":"2010","unstructured":"Luedtke, J., Ahmed, S., Nemhauser, G.L.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122(2), 247\u2013272 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"227_CR47","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/ijoc.4.1.70","volume":"4","author":"J Lee","year":"1992","unstructured":"Lee, J., Ryan, J.: Matroid applications and algorithms. ORSA J. Comput. 4(1), 70\u201398 (1992)","journal-title":"ORSA J. Comput."},{"key":"227_CR48","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"EL Lawler","year":"2001","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Courier Corporation, New York (2001)"},{"key":"227_CR49","first-page":"179","volume":"5","author":"J Oxley","year":"2003","unstructured":"Oxley, J.: What is a matroid. Cubo 5, 179\u2013218 (2003)","journal-title":"Cubo"},{"key":"227_CR50","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662041","volume-title":"Matroid Applications","author":"N White","year":"1992","unstructured":"White, N., White, N.M.: Matroid Applications, vol. 40. Cambridge University Press (1992)"},{"issue":"2","key":"227_CR51","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1137\/130906593","volume":"24","author":"A Caprara","year":"2014","unstructured":"Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: A study on the computational complexity of the bilevel knapsack problem. SIAM J. Optim. 24(2), 823\u2013838 (2014)","journal-title":"SIAM J. Optim."},{"key":"227_CR52","first-page":"1","volume-title":"Handbooks in Operations Research and Management Science","author":"RK Ahuja","year":"1995","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Reddy, M.: Applications of network optimization. In: Ball, M., Magnanti, T., Monma, C., Nemhauser, G. (eds.) Handbooks in Operations Research and Management Science, vol. 7, pp. 1\u201383. Elsevier, Amsterdam (1995)"},{"issue":"2","key":"227_CR53","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1006\/jagm.1999.1026","volume":"33","author":"GN Frederickson","year":"1999","unstructured":"Frederickson, G.N., Solis-Oba, R.: Increasing the weight of minimum spanning trees. J. Algorithms 33(2), 244\u2013266 (1999)","journal-title":"J. Algorithms"},{"issue":"3","key":"227_CR54","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1002\/net.21881","volume":"74","author":"X Shi","year":"2019","unstructured":"Shi, X., Zeng, B., Prokopyev, O.A.: On bilevel minimum and bottleneck spanning tree problems. Networks 74(3), 251\u2013273 (2019)","journal-title":"Networks"},{"key":"227_CR55","unstructured":"Wei, N., Walteros, J.L., Pajouh, F.M.: Integer programming formulations for minimum spanning tree interdiction. Optimization online (2019). http:\/\/www.optimization-online.org\/DB_FILE\/2019\/08\/7325.pdf. Acessed 9 April 2020"},{"issue":"1","key":"227_CR56","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00291-010-0219-y","volume":"34","author":"T Kis","year":"2012","unstructured":"Kis, T., Kov\u00e1cs, A.: On bilevel machine scheduling problems. OR Spectrum 34(1), 43\u201368 (2012)","journal-title":"OR Spectrum"},{"issue":"3","key":"227_CR57","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manag. Sci. 45(3), 414\u2013424 (1999)","journal-title":"Manag. Sci."},{"key":"227_CR58","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (2002)"},{"issue":"17","key":"227_CR59","doi-asserted-by":"publisher","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. Discrete Appl. Math. 159(17), 1933\u20131946 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"227_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec, J., Sosi\u010d, R.: Snap: a general-purpose network analysis and graph-mining library. ACM Trans. Intell. Syst. Technol. 8(1), 1 (2016)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"227_CR61","first-page":"503","volume-title":"Network Models, Handbooks in Operations Research and Management Science","author":"TL Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M., Magnanti, T., Monma, C., Nemhauser, G. (eds.) Network Models, Handbooks in Operations Research and Management Science, vol. 7, pp. 503\u2013615. Elsevier (1995)"},{"key":"227_CR62","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-1-4613-0255-1_9","volume-title":"Steiner Trees in Industry","author":"T Koch","year":"2001","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: Steinlib: an updated library on steiner tree problems in graphs. In: Cheng, X.Z., Du, D.Z. (eds.) Steiner Trees in Industry, pp. 285\u2013325. Springer, Boston (2001)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-022-00227-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-022-00227-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-022-00227-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,25]],"date-time":"2023-02-25T13:27:38Z","timestamp":1677331658000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-022-00227-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,8]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["227"],"URL":"https:\/\/doi.org\/10.1007\/s12532-022-00227-z","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,8]]},"assertion":[{"value":"29 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}