{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T05:01:18Z","timestamp":1772082078764,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s11590-022-01869-7","type":"journal-article","created":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T08:02:52Z","timestamp":1651651372000},"page":"191-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Exact solution approaches for a class of bilevel fractional programs"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4651-810X","authenticated-orcid":false,"given":"Jing","family":"Yang","sequence":"first","affiliation":[]},{"given":"Xueyu","family":"Shi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2888-8630","authenticated-orcid":false,"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"1869_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River, New Jersey (1993)"},{"issue":"2","key":"1869_CR2","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":"3","key":"1869_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/net.20236","volume":"52","author":"H Bayrak","year":"2008","unstructured":"Bayrak, H., Bailey, M.D.: Shortest path network interdiction with asymmetric information. Networks 52(3), 133\u2013140 (2008)","journal-title":"Networks"},{"issue":"1","key":"1869_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10898-016-0487-4","volume":"69","author":"JS Borrero","year":"2017","unstructured":"Borrero, J.S., Gillen, C., Prokopyev, O.A.: Fractional 0\u20131 programming: applications and algorithms. J. Global Optim. 69(1), 255\u2013282 (2017)","journal-title":"J. Global Optim."},{"issue":"1","key":"1869_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0377-2217(98)00078-2","volume":"114","author":"HI Calvete","year":"1999","unstructured":"Calvete, H.I., Gal\u00e9, C.: The bilevel linear\/linear fractional programming problem. Eur. J. Oper. Res. 114(1), 188\u2013197 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1869_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.orl.2017.12.009","volume":"46","author":"M Carvalho","year":"2018","unstructured":"Carvalho, M., Lodi, A., Marcotte, P.: A polynomial algorithm for a continuous bilevel knapsack problem. Oper. Res. Lett. 46(2), 185\u2013188 (2018)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"1869_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/net.3230070405","volume":"7","author":"R Chandrasekaran","year":"1977","unstructured":"Chandrasekaran, R.: Minimal ratio spanning trees. Networks 7(4), 335\u2013342 (1977)","journal-title":"Networks"},{"issue":"3\u20134","key":"1869_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A Charnes","year":"1962","unstructured":"Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Naval Res Logis Quart 9(3\u20134), 181\u2013186 (1962)","journal-title":"Naval Res Logis Quart"},{"issue":"1","key":"1869_CR9","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."},{"issue":"7","key":"1869_CR10","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Manage. Sci. 13(7), 492\u2013498 (1967)","journal-title":"Manage. Sci."},{"key":"1869_CR11","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. I. Publicationes Mathematicae (Debrecen) 6, 290\u2013297 (1959)","journal-title":"I. Publicationes Mathematicae (Debrecen)"},{"issue":"2","key":"1869_CR12","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."},{"key":"1869_CR13","unstructured":"Fortet, R.: Applications de l\u2019algebre de boole en recherche op\u00e9rationelle. Revue Fran\u00e7aise de Recherche Op\u00e9rationelle 4(14), 17\u201326 (1960)"},{"key":"1869_CR14","doi-asserted-by":"crossref","unstructured":"Frenk, H., Schaible, S.: Fractional programming. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1080\u20131091. Springer (2009)","DOI":"10.1007\/978-0-387-74759-0_189"},{"key":"1869_CR15","doi-asserted-by":"crossref","unstructured":"Furini, F., Ljubi\u0107, I., San\u00a0Segundo, P., Zhao, Y.: A branch-and-cut algorithm for the edge interdiction clique problem. Eur. J. Oper. Res. 294(1), 54\u201369 (2021)","DOI":"10.1016\/j.ejor.2021.01.030"},{"issue":"4","key":"1869_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover, F.: Improved linear integer programming formulations of nonlinear integer problems. Manage. Sci. 22(4), 455\u2013460 (1975)","journal-title":"Manage. Sci."},{"key":"1869_CR17","unstructured":"Gurobi Optimization LLC.: Gurobi optimizer reference manual (2021) https:\/\/www.gurobi.com\/documentation\/9.1\/refman\/index.html"},{"issue":"3","key":"1869_CR18","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1002\/nav.21839","volume":"66","author":"T Holzmann","year":"2019","unstructured":"Holzmann, T., Smith, J.C.: Shortest path interdiction problem with arc improvement recourse: a multiobjective approach. Naval Res. Logist. 66(3), 230\u2013252 (2019)","journal-title":"Naval Res. Logist."},{"issue":"2","key":"1869_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli, E., Wood, R.: Shortest-path network interdiction. Networks 40(2), 97\u2013111 (2002)","journal-title":"Networks"},{"key":"1869_CR20","doi-asserted-by":"crossref","unstructured":"Kleinert, T., Labb\u00e9, M., Plein, F.A., Schmidt, M.: There\u2019s no free lunch: on the hardness of choosing a correct big-m in bilevel optimization. Oper. Res. 68(6), 1716\u20131721 (2020)","DOI":"10.1287\/opre.2019.1944"},{"issue":"1","key":"1869_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03398596","volume":"37","author":"N Malhotra","year":"2000","unstructured":"Malhotra, N., Arora, S.: An algorithm to solve linear fractional bilevel programming problem via goal programming. Opsearch 37(1), 1\u201313 (2000)","journal-title":"Opsearch"},{"issue":"1","key":"1869_CR22","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ejor.2006.09.053","volume":"183","author":"S Mishra","year":"2007","unstructured":"Mishra, S.: Weighting method for bi-level linear fractional programming problems. Eur. J. Oper. Res. 183(1), 296\u2013302 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1869_CR23","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1002\/net.21556","volume":"64","author":"FM Pajouh","year":"2014","unstructured":"Pajouh, F.M., Boginski, V., Pasiliao, E.L.: Minimum vertex blocker clique problem. Networks 64(1), 48\u201364 (2014)","journal-title":"Networks"},{"issue":"1","key":"1869_CR24","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s11081-017-9369-y","volume":"19","author":"S Pineda","year":"2018","unstructured":"Pineda, S., Bylling, H., Morales, J.: Efficiently solving linear bilevel programming problems using off-the-shelf optimization software. Optim. Eng. 19(1), 187\u2013211 (2018)","journal-title":"Optim. Eng."},{"key":"1869_CR25","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-1-4613-0303-9_6","volume-title":"Handbook of Combinatorial Optimization","author":"T Radzik","year":"1998","unstructured":"Radzik, T.: Fractional Combinatorial Optimization. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 429\u2013478. Springer-Verlag, New York (1998)"},{"key":"1869_CR26","first-page":"1077","volume-title":"Encyclopedia of Optimization","author":"T Radzik","year":"2009","unstructured":"Radzik, T.: Fractional Combinatorial Optimizatiom. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1077\u20131080. Springer, US (2009)"},{"key":"1869_CR27","volume-title":"A Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer Science & Business Media, Boston (2013)"},{"issue":"3","key":"1869_CR28","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2019.06.024","volume":"283","author":"JC Smith","year":"2020","unstructured":"Smith, J.C., Song, Y.: A survey of network interdiction models and algorithms. Eur. J. Oper. Res. 283(3), 797\u2013811 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"1869_CR29","unstructured":"Toksar\u0131, M.D.: Taylor series approach for bi-level linear fractional programming problem. Sel\u00e7uk J. Appl. Math. 11(1), 63\u201369 (2010)"},{"issue":"3","key":"1869_CR30","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/s10898-011-9832-9","volume":"56","author":"O Ursulenko","year":"2013","unstructured":"Ursulenko, O., Butenko, S., Prokopyev, O.A.: A global optimization algorithm for solving the minimum multiple ratio spanning tree problem. J. Global Optim. 56(3), 1029\u20131043 (2013)","journal-title":"J. Global Optim."},{"issue":"2","key":"1869_CR31","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.cie.2012.04.002","volume":"63","author":"G Wang","year":"2012","unstructured":"Wang, G., Ziyou, G., Zhongping, W.: A global optimization algorithm for solving the bi-level linear fractional programming problem. Comput. Indus. Eng. 63(2), 428\u2013432 (2012)","journal-title":"Comput. Indus. Eng."},{"key":"1869_CR32","doi-asserted-by":"crossref","unstructured":"Wei, N., Walteros, J.L., Pajouh, F.M.: Integer programming formulations for minimum spanning tree interdiction. INFORMS J. Comput. (2021)","DOI":"10.1287\/ijoc.2020.1018"},{"issue":"3","key":"1869_CR33","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":"1\u20132","key":"1869_CR34","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."},{"issue":"8","key":"1869_CR35","doi-asserted-by":"publisher","first-page":"2661","DOI":"10.1007\/s11590-020-01687-9","volume":"15","author":"Q Zhang","year":"2021","unstructured":"Zhang, Q., Guan, X., Wang, H., Pardalos, P.M.: Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance. Optim. Lett. 15(8), 2661\u20132680 (2021)","journal-title":"Optim. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01869-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01869-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01869-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T10:57:55Z","timestamp":1672829875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01869-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,4]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1869"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01869-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,4]]},"assertion":[{"value":"2 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}