{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:45:01Z","timestamp":1740141901554,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T00:00:00Z","timestamp":1700697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T00:00:00Z","timestamp":1700697600000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10288-023-00555-3","type":"journal-article","created":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T04:23:56Z","timestamp":1700713436000},"page":"419-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An optimal algorithm for variable knockout problems"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4758-9970","authenticated-orcid":false,"given":"J. E.","family":"Beasley","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,23]]},"reference":[{"issue":"1","key":"555_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg T (2009) SCIP: Solving constraint integer programs. Math Program Comput 1(1):1\u201341","journal-title":"Math Program Comput"},{"issue":"3","key":"555_CR2","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":"1","key":"555_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"JE Beasley","year":"1987","unstructured":"Beasley JE (1987) An algorithm for set covering problem. Eur J Oper Res 31(1):85\u201393","journal-title":"Eur J Oper Res"},{"issue":"11","key":"555_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"issue":"4","key":"555_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"JE Beasley","year":"1989","unstructured":"Beasley JE, Christofides N (1989) An algorithm for the resource constrained shortest path problem. Networks 19(4):379\u2013394","journal-title":"Networks"},{"issue":"2","key":"555_CR6","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley JE, Chu PC (1996) A genetic algorithm for the set covering problem. Eur J Oper Res 94(2):392\u2013404","journal-title":"Eur J Oper Res"},{"issue":"2","key":"555_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"JE Beasley","year":"1992","unstructured":"Beasley JE, Jornsten K (1992) Enhancing an algorithm for set covering problems. Eur J Oper Res 58(2):293\u2013300","journal-title":"Eur J Oper Res"},{"issue":"1","key":"555_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1093\/bioinformatics\/btl554","volume":"23","author":"JE Beasley","year":"2007","unstructured":"Beasley JE, Planes FJ (2007) Recovering metabolic pathways via optimization. Bioinformatics 23(1):92\u201398","journal-title":"Bioinformatics"},{"issue":"2","key":"555_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2023.01.008","volume":"311","author":"Y Beck","year":"2023","unstructured":"Beck Y, Ljubi I, Schmidt M (2023) A survey on bilevel optimization under uncertainty. Eur J Oper Res 311(2):401\u2013426","journal-title":"Eur J Oper Res"},{"issue":"5","key":"555_CR10","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Oper Res 47(5):730\u2013743","journal-title":"Oper Res"},{"key":"555_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara A, Toth P, Fischetti M (2000) Algorithms for the set covering problem. Ann Oper Res 98:353\u2013371","journal-title":"Ann Oper Res"},{"issue":"1","key":"555_CR12","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 (2007) An overview of bilevel optimization. Ann Oper Res 153(1):235\u2013256","journal-title":"Ann Oper Res"},{"issue":"3","key":"555_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/0233193031000149894","volume":"52","author":"S Dempe","year":"2003","unstructured":"Dempe S (2003) Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52(3):333\u2013359","journal-title":"Optimization"},{"key":"555_CR14","doi-asserted-by":"crossref","unstructured":"DeNegre ST, Ralphs TK (2009) A branch-and-cut algorithm for integer bilevel linear programs. In: Chinneck JW, Kristjansson B, Saltzman MJ (eds) Operations research and cyber-infrastructure. Operations Research\/Computer Science Interfaces, vol 47. Springer, Boston","DOI":"10.1007\/978-0-387-88843-9_4"},{"issue":"2","key":"555_CR15","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":"555_CR16","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/310301","author":"VV Kalashnikov","year":"2023","unstructured":"Kalashnikov VV, Dempe S, Perez-Valdes GA, Kalashnykova NI, Camacho-Vallejo JF (2023) Bilevel programming and applications. Math Probl Eng. https:\/\/doi.org\/10.1155\/2015\/310301","journal-title":"Math Probl Eng"},{"key":"555_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100007","volume":"9","author":"T Kleinert","year":"2021","unstructured":"Kleinert T, Labbe M, Ljubic I, Schmidt M (2021) A survey on mixed-integer programming techniques in bilevel optimization. EURO J Comput Optim 9:100007","journal-title":"EURO J Comput Optim"},{"issue":"3","key":"555_CR18","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"GH Lan","year":"2007","unstructured":"Lan GH, DePuy GW, Whitehouse GE (2007) An effective and simple heuristic for the set covering problem. Eur J Oper Res 176(3):1387\u20131403","journal-title":"Eur J Oper Res"},{"issue":"3","key":"555_CR19","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1016\/j.ejor.2022.10.038","volume":"307","author":"M Leitner","year":"2023","unstructured":"Leitner M, Ljubic I, Monaci M, Sinnl M, Tantnmts K (2023) An exact method for binary fortification games. Eur J Oper Res 307(3):1026\u20131039","journal-title":"Eur J Oper Res"},{"issue":"1","key":"555_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/ijoc.2016.0721","volume":"29","author":"L Lozano","year":"2017","unstructured":"Lozano L, Smith JC (2017) A backward sampling framework for interdiction problems with fortification. INFORMS J Comput 29(1):123\u2013139","journal-title":"INFORMS J Comput"},{"issue":"9","key":"555_CR21","doi-asserted-by":"publisher","first-page":"5478","DOI":"10.1109\/TSMC.2023.3271125","volume":"53","author":"J-A Mejia-de-Dios","year":"2023","unstructured":"Mejia-de-Dios J-A, Rodriguez-Molina A, Mezura-Montes E (2023) Multiobjective bilevel optimization: a survey of the state-of-the-art. IEEE Trans Syst Man Cybern Syst 53(9):5478\u20135490","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"2","key":"555_CR22","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.01.035","volume":"205","author":"Z Naji-Azimi","year":"2010","unstructured":"Naji-Azimi Z, Toth P, Galli L (2010) An electromagnetism metaheuristic for the unicost set covering problem. Eur J Oper Res 205(2):290\u2013300","journal-title":"Eur J Oper Res"},{"issue":"20","key":"555_CR23","doi-asserted-by":"publisher","first-page":"2723","DOI":"10.1093\/bioinformatics\/btp441","volume":"25","author":"FJ Planes","year":"2009","unstructured":"Planes FJ, Beasley JE (2009) An optimization model for metabolic pathways. Bioinformatics 25(20):2723\u20132729","journal-title":"Bioinformatics"},{"issue":"10","key":"555_CR24","doi-asserted-by":"publisher","first-page":"2244","DOI":"10.1016\/j.dam.2008.06.035","volume":"157","author":"FJ Planes","year":"2009","unstructured":"Planes FJ, Beasley JE (2009) Path finding approaches and metabolic pathways. Discret Appl Math 157(10):2244\u20132256","journal-title":"Discret Appl Math"},{"issue":"4","key":"555_CR25","doi-asserted-by":"publisher","first-page":"2391","DOI":"10.1007\/s12351-019-00514-z","volume":"21","author":"V Reyes","year":"2021","unstructured":"Reyes V, Araya I (2021) A GRASP-based scheme for the set covering problem. Oper Res Int J 21(4):2391\u20132408","journal-title":"Oper Res Int J"},{"issue":"2","key":"555_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1093\/bib\/bbu009","volume":"16","author":"A Rezola","year":"2015","unstructured":"Rezola A, Pey J, Tobalina L, Rubio A, Beasley JE, Planes FJ (2015) Advances in network-based metabolic pathway analysis and gene expression data integration. Brief Bioinform 16(2):265\u2013279","journal-title":"Brief Bioinform"},{"issue":"2","key":"555_CR27","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.cie.2010.04.004","volume":"59","author":"CM Rocco","year":"2010","unstructured":"Rocco CM, 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":"555_CR28","unstructured":"Schmidt M, Beck Y (2023) A gentle and incomplete introduction to bilevel optimization. https:\/\/optimization-online.org\/wp-content\/uploads\/2021\/06\/bilevel-optimization.pdf. Accessed August 23"},{"key":"555_CR29","unstructured":"SCIP (2023) Solving constraint integer programs. https:\/\/www.scipopt.org\/. Accessed 21 February 2023"},{"issue":"2","key":"555_CR30","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TEVC.2017.2712906","volume":"22","author":"A Sinha","year":"2018","unstructured":"Sinha A, Malo P, Deb K (2018) A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans Evol Comput 22(2):276\u2013295","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"555_CR31","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"},{"issue":"3","key":"555_CR32","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01096458","volume":"5","author":"LN Vicente","year":"1994","unstructured":"Vicente LN, Calamai PH (1994) Bilevel and multilevel programming: a bibliography review. J Glob Optim 5(3):291\u2013306","journal-title":"J Glob Optim"},{"issue":"2","key":"555_CR33","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ejor.2022.01.009","volume":"202","author":"N Wei","year":"2022","unstructured":"Wei N, Walteros JL (2022) Integer programming methods for solving binary interdiction games. Eur J Oper Res 202(2):456\u2013469","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00555-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-023-00555-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00555-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T09:06:47Z","timestamp":1732698407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-023-00555-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,23]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["555"],"URL":"https:\/\/doi.org\/10.1007\/s10288-023-00555-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2023,11,23]]},"assertion":[{"value":"1 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}