{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:59:35Z","timestamp":1770742775783,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T00:00:00Z","timestamp":1693440000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T00:00:00Z","timestamp":1693440000000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10479-023-05563-4","type":"journal-article","created":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T06:01:57Z","timestamp":1693461717000},"page":"213-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Capacitated multiple allocation hub location problems under the risk of interdiction: model formulations and solution approaches"],"prefix":"10.1007","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2379-2683","authenticated-orcid":false,"given":"Vishal","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sachin","family":"Jayaswal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankur","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,31]]},"reference":[{"issue":"3","key":"5563_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10100-009-0110-6","volume":"18","author":"D Aksen","year":"2010","unstructured":"Aksen, D., Piyade, N., & Aras, N. (2010). The budget constrained r-interdiction median problem with capacity expansion. Central European Journal of Operations Research, 18(3), 269\u2013291.","journal-title":"Central European Journal of Operations Research"},{"issue":"1","key":"5563_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.orl.2009.09.013","volume":"38","author":"DS Altner","year":"2010","unstructured":"Altner, D. S., Ergun, \u00d6., & Uhan, N. A. (2010). The maximum flow network interdiction problem: Valid inequalities, integrality gaps, and approximability. Operations Research Letters, 38(1), 33\u201338.","journal-title":"Operations Research Letters"},{"issue":"1","key":"5563_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2020.09.039","volume":"291","author":"SA Alumur","year":"2021","unstructured":"Alumur, S. A., Campbell, J. F., Contreras, I., Kara, B. Y., Marianov, V., & O\u2019Kelly, M. E. (2021). Perspectives on modeling hub location problems. European Journal of Operational Research, 291(1), 1\u201317.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5563_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190(1), 1\u201321.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5563_CR5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1022645805569","volume":"93","author":"C Audet","year":"1997","unstructured":"Audet, C., Hansen, P., Jaumard, B., & Savard, G. (1997). Links between linear bilevel and mixed 0\u20131 programming problems. Journal of Optimization Theory and Applications, 93(2), 273\u2013300.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"5563_CR6","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. (2021). Multilevel approaches for the critical node problem. Operations Research, 69(2), 486\u2013508.","journal-title":"Operations Research"},{"issue":"3","key":"5563_CR7","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/S0377-2217(03)00072-9","volume":"155","author":"N Boland","year":"2004","unstructured":"Boland, N., Krishnamoorthy, M., Ernst, A. T., & Ebery, J. (2004). Preprocessing and cutting for multiple allocation hub location problems. European Journal of Operational Research, 155(3), 638\u2013653.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5563_CR8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72(2), 387\u2013405.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5563_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"JF Campbell","year":"2012","unstructured":"Campbell, J. F., & O\u2019Kelly, M. E. (2012). Twenty-five years of hub location research. Transportation Science, 46(2), 153\u2013169.","journal-title":"Transportation Science"},{"issue":"2","key":"5563_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1111\/j.1538-4632.2007.00698.x","volume":"39","author":"RL Church","year":"2007","unstructured":"Church, R. L., & Scaparra, M. P. (2007). Protecting critical assets: The r-interdiction median problem with fortification. Geographical Analysis, 39(2), 129\u2013146.","journal-title":"Geographical Analysis"},{"issue":"3","key":"5563_CR11","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1111\/j.1467-8306.2004.00410.x","volume":"94","author":"RL Church","year":"2004","unstructured":"Church, R. L., Scaparra, M. P., & Middleton, R. S. (2004). Identifying critical infrastructure: The median and covering facility interdiction problems. Annals of the Association of American Geographers, 94(3), 491\u2013502.","journal-title":"Annals of the Association of American Geographers"},{"key":"5563_CR12","unstructured":"Collado, R.\u00a0A., & Papp, D. (2012). Network interdiction: Models, applications, unexplored directions. Rutcor Res Rep, RRR4, Rutgers University, New Brunswick, NJ."},{"key":"5563_CR13","doi-asserted-by":"crossref","unstructured":"Contreras, I. (2015). Hub location problems. In Location science (pp. 311\u2013344). Springer.","DOI":"10.1007\/978-3-319-13111-5_12"},{"key":"5563_CR14","doi-asserted-by":"crossref","unstructured":"Contreras, I., & O\u2019Kelly, M. (2019). Hub location problems. In Location science (pp. 327\u2013363). Springer.","DOI":"10.1007\/978-3-030-32177-2_12"},{"issue":"3","key":"5563_CR15","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s00291-008-0159-y","volume":"31","author":"I Contreras","year":"2009","unstructured":"Contreras, I., D\u00edaz, J. A., & Fern\u00e1ndez, E. (2009). Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum, 31(3), 483\u2013505.","journal-title":"OR Spectrum"},{"issue":"1","key":"5563_CR16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/ijoc.1100.0391","volume":"23","author":"I Contreras","year":"2011","unstructured":"Contreras, I., D\u00edaz, J. A., & Fern\u00e1ndez, E. (2011). Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS Journal on Computing, 23(1), 41\u201355.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"5563_CR17","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s10479-015-2091-2","volume":"258","author":"I Contreras","year":"2017","unstructured":"Contreras, I., Tanash, M., & Vidyarthi, N. (2017). Exact and heuristic approaches for the cycle hub location problem. Annals of Operations Research, 258(2), 655\u2013677.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"5563_CR18","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. (1998). Stochastic network interdiction. Operations Research, 46(2), 184\u2013197.","journal-title":"Operations Research"},{"issue":"2","key":"5563_CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E. D., & Mor\u00e9, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2), 201\u2013213.","journal-title":"Mathematical Programming"},{"issue":"3","key":"5563_CR20","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0377-2217(98)00395-6","volume":"120","author":"J Ebery","year":"2000","unstructured":"Ebery, J., Krishnamoorthy, M., Ernst, A., & Boland, N. (2000). The capacitated multiple allocation hub location problem: Formulations and algorithms. European Journal of Operational Research, 120(3), 614\u2013631.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"5563_CR21","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.cor.2003.11.016","volume":"32","author":"S Elhedhli","year":"2005","unstructured":"Elhedhli, S., & Hu, F. X. (2005). Hub-and-spoke network design with congestion. Computers & Operations Research, 32(6), 1615\u20131632.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"5563_CR22","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/ijoc.1090.0335","volume":"22","author":"S Elhedhli","year":"2010","unstructured":"Elhedhli, S., & Wu, H. (2010). A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion. INFORMS Journal on Computing, 22(2), 282\u2013296.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"5563_CR23","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"AT Ernst","year":"1996","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4(3), 139\u2013154.","journal-title":"Location Science"},{"issue":"1","key":"5563_CR24","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0377-2217(96)00340-2","volume":"104","author":"AT Ernst","year":"1998","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1998). Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research, 104(1), 100\u2013112.","journal-title":"European Journal of Operational Research"},{"key":"5563_CR25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"AT Ernst","year":"1999","unstructured":"Ernst, A. T., & Krishnamoorthy, M. (1999). Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research, 86, 141\u2013159.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"5563_CR26","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R. Z., Hekmatfar, M., Arabani, A. B., & Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering, 64(4), 1096\u20131109.","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"5563_CR27","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1287\/opre.2017.1650","volume":"65","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., & Sinnl, M. (2017). A new general-purpose algorithm for mixed-integer bilevel linear programs. Operations Research, 65(6), 1615\u20131637.","journal-title":"Operations Research"},{"issue":"2","key":"5563_CR28","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. (2019). Interdiction games and monotonicity, with application to knapsack problems. INFORMS Journal on Computing, 31(2), 390\u2013410.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"5563_CR29","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/0377-2217(93)E0217-L","volume":"82","author":"A Frangioni","year":"1995","unstructured":"Frangioni, A. (1995). On a new class of bilevel programming problems and its use for reformulating mixed integer problems. European Journal of Operational Research, 82(3), 615\u2013646.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5563_CR30","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2021.01.030","volume":"294","author":"F Furini","year":"2021","unstructured":"Furini, F., Ljubi\u0107, I., San Segundo, P., & Zhao, Y. (2021). A branch-and-cut algorithm for the edge interdiction clique problem. European Journal of Operational Research, 294(1), 54\u201369.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5563_CR31","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2017.11.035","volume":"267","author":"N Ghaffarinasab","year":"2018","unstructured":"Ghaffarinasab, N., & Atayi, R. (2018). An implicit enumeration algorithm for the hub interdiction median problem with fortification. European Journal of Operational Research, 267(1), 23\u201339.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5563_CR32","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.ejor.2017.11.058","volume":"267","author":"N Ghaffarinasab","year":"2018","unstructured":"Ghaffarinasab, N., & Motallebzadeh, A. (2018). Hub interdiction problem variants: Models and metaheuristic solution algorithms. European Journal of Operational Research, 267(2), 496\u2013512.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5563_CR33","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli, E., & Wood, R. K. (2002). Shortest-path network interdiction. Networks: An International Journal, 40(2), 97\u2013111.","journal-title":"Networks: An International Journal"},{"key":"5563_CR34","volume":"9","author":"T Kleinert","year":"2021","unstructured":"Kleinert, T., Labb\u00e9, M., Ljubi\u0107, I., & Schmidt, M. (2021). A survey on mixed-integer programming techniques in bilevel optimization. EURO Journal on Computational Optimization, 9, 100007.","journal-title":"EURO Journal on Computational Optimization"},{"issue":"2","key":"5563_CR35","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1111\/gean.12006","volume":"45","author":"TL Lei","year":"2013","unstructured":"Lei, T. L. (2013). Identifying critical facilities in hub-and-spoke networks: A hub interdiction median problem. Geographical Analysis, 45(2), 105\u2013122.","journal-title":"Geographical Analysis"},{"issue":"1","key":"5563_CR36","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/07408170600729192","volume":"39","author":"C Lim","year":"2007","unstructured":"Lim, C., & Smith, J. C. (2007). Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions, 39(1), 15\u201326.","journal-title":"IIE Transactions"},{"issue":"3","key":"5563_CR37","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.orl.2017.02.007","volume":"45","author":"L Lozano","year":"2017","unstructured":"Lozano, L., Smith, J. C., & Kurz, M. E. (2017). Solving the traveling salesman problem with interdiction and fortification. Operations Research Letters, 45(3), 210\u2013216.","journal-title":"Operations Research Letters"},{"issue":"3","key":"5563_CR38","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. (1970). Optimal interdiction of a supply network. Naval Research Logistics Quarterly, 17(3), 261\u2013268.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"5563_CR39","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2010.08.030","volume":"209","author":"JR O\u2019Hanley","year":"2011","unstructured":"O\u2019Hanley, J. R., & Church, R. L. (2011). Designing robust coverage networks to hedge against worst-case facility losses. European Journal of Operational Research, 209(1), 23\u201336.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"5563_CR40","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1111\/j.1538-4632.1986.tb00106.x","volume":"18","author":"ME O\u2019Kelly","year":"1986","unstructured":"O\u2019Kelly, M. E. (1986). Activity levels at hub facilities in interacting networks. Geographical Analysis, 18(4), 343\u2013356.","journal-title":"Geographical Analysis"},{"issue":"3","key":"5563_CR41","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"ME O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32(3), 393\u2013404.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"5563_CR42","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/S0191-2615(98)00021-6","volume":"32","author":"ME O\u2019Kelly","year":"1998","unstructured":"O\u2019Kelly, M. E., & Bryan, D. (1998). Hub location with flow economies of scale. Transportation Research Part B: Methodological, 32(8), 605\u2013616.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"4","key":"5563_CR43","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s10845-012-0717-7","volume":"25","author":"F Parvaresh","year":"2014","unstructured":"Parvaresh, F., Husseini, S. M., Golpayegany, S. H., & Karimi, B. (2014). Hub network design problem in the presence of disruptions. Journal of Intelligent Manufacturing, 25(4), 755\u2013774.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"5563_CR44","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.ejor.2018.03.031","volume":"270","author":"P Ramamoorthy","year":"2018","unstructured":"Ramamoorthy, P., Jayaswal, S., Sinha, A., & Vidyarthi, N. (2018). Multiple allocation hub interdiction and protection problems: Model formulations and solution approaches. European Journal of Operational Research, 270(1), 230\u2013245.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"5563_CR45","doi-asserted-by":"crossref","first-page":"1905","DOI":"10.1016\/j.cor.2006.09.019","volume":"35","author":"MP Scaparra","year":"2008","unstructured":"Scaparra, M. P., & Church, R. L. (2008). A bilevel mixed-integer program for critical infrastructure protection planning. Computers & Operations Research, 35(6), 1905\u20131923.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"5563_CR46","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.ejor.2007.05.027","volume":"189","author":"MP Scaparra","year":"2008","unstructured":"Scaparra, M. P., & Church, R. L. (2008). An exact solution approach for the interdiction median problem with fortification. European Journal of Operational Research, 189(1), 76\u201392.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5563_CR47","doi-asserted-by":"crossref","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. (2007). Survivable network design under optimal and heuristic interdiction scenarios. Journal of Global Optimization, 38(2), 181\u2013199.","journal-title":"Journal of Global Optimization"},{"key":"5563_CR48","doi-asserted-by":"crossref","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. (2020). A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Mathematical Programming Computation, 12, 529\u2013568.","journal-title":"Mathematical Programming Computation"},{"key":"5563_CR49","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105056","volume":"124","author":"T Ullmert","year":"2020","unstructured":"Ullmert, T., Ruzika, S., & Sch\u00f6bel, A. (2020). On the p-hub interdiction problem. Computers & Operations Research, 124, 105056.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"5563_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"RK Wood","year":"1993","unstructured":"Wood, R. K. (1993). Deterministic network interdiction. Mathematical and Computer Modelling, 17(2), 1\u201318.","journal-title":"Mathematical and Computer Modelling"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05563-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05563-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05563-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T17:18:57Z","timestamp":1709054337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05563-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,31]]},"references-count":50,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["5563"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05563-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,31]]},"assertion":[{"value":"25 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2023","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}