{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T12:06:09Z","timestamp":1767009969850,"version":"3.48.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T00:00:00Z","timestamp":1766966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T00:00:00Z","timestamp":1766966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71971167"],"award-info":[{"award-number":["71971167"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202206280182"],"award-info":[{"award-number":["202206280182"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10957-025-02890-3","type":"journal-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:11:34Z","timestamp":1767006694000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Split Delivery Path Routing Problems"],"prefix":"10.1007","volume":"208","author":[{"given":"Jun","family":"Wu","sequence":"first","affiliation":[]},{"given":"Feng","family":"Chu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9871-8851","authenticated-orcid":false,"given":"Zhen","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yongxi","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,29]]},"reference":[{"issue":"2","key":"2890_CR1","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/trsc.1050.0117","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti, C., Savelsbergh, M.W., Speranza, M.G.: Worst-case analysis for split delivery vehicle routing problems. Transp. Sci. 40(2), 226\u2013234 (2006)","journal-title":"Transp. Sci."},{"issue":"1","key":"2890_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/trsc.1070.0204","volume":"42","author":"C Archetti","year":"2008","unstructured":"Archetti, C., Speranza, M.G., Savelsbergh, M.W.: An optimization-based heuristic for the split delivery vehicle routing problem. Transp. Sci. 42(1), 22\u201331 (2008)","journal-title":"Transp. Sci."},{"issue":"1","key":"2890_CR3","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ejor.2017.07.033","volume":"265","author":"R Atefi","year":"2018","unstructured":"Atefi, R., Salari, M., Coelho, L.C., Renaud, J.: The open vehicle routing problem with decoupling points. Eur. J. Oper. Res. 265(1), 316\u2013327 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2890_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s11590-010-0252-4","volume":"6","author":"J Bae","year":"2012","unstructured":"Bae, J., Rathinam, S.: Approximation algorithms for multiple terminal. Hamiltonian path problems. Optimization Letters 6(1), 69\u201385 (2012)","journal-title":"Hamiltonian path problems. Optimization Letters"},{"issue":"3","key":"2890_CR5","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1057\/jors.2013.188","volume":"66","author":"J Bauer","year":"2015","unstructured":"Bauer, J., Lysgaard, J.: The offshore wind farm array cable layout problem: a planar open vehicle routing problem. Journal of the Operational Research Society 66(3), 360\u2013368 (2015)","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"2890_CR6","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1287\/opre.48.5.801.12407","volume":"48","author":"J-M Belenguer","year":"2000","unstructured":"Belenguer, J.-M., Martinez, M., Mota, E.: A lower bound for the split delivery vehicle routing problem. Oper. Res. 48(5), 801\u2013810 (2000)","journal-title":"Oper. Res."},{"issue":"4","key":"2890_CR7","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1287\/trsc.2018.0862","volume":"53","author":"N Bianchessi","year":"2019","unstructured":"Bianchessi, N., Drexl, M., Irnich, S.: The split delivery vehicle routing problem with time windows and customer inconvenience constraints. Transp. Sci. 53(4), 1067\u20131084 (2019)","journal-title":"Transp. Sci."},{"issue":"2","key":"2890_CR8","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1287\/trsc.2018.0825","volume":"53","author":"N Bianchessi","year":"2019","unstructured":"Bianchessi, N., Irnich, S.: Branch-and-cut for the split delivery vehicle routing problem with time windows. Transp. Sci. 53(2), 442\u2013462 (2019)","journal-title":"Transp. Sci."},{"issue":"2","key":"2890_CR9","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ejor.2020.01.008","volume":"284","author":"J Brand\u00e3o","year":"2020","unstructured":"Brand\u00e3o, J.: A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. Eur. J. Oper. Res. 284(2), 559\u2013571 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"2890_CR10","doi-asserted-by":"crossref","unstructured":"Chandler, P.R., Pachter, M., Swaroop, D., Fowler, J.M., Howlett, J.K., Rasmussen, S., Schumacher, C., Nygard, K.: Complexity in UAV cooperative control. In: Proceedings of the 2002 American Control Conference (IEEE Cat. No. CH37301), 3, pp. 1831\u20131836. IEEE, (2022)","DOI":"10.1109\/ACC.2002.1023833"},{"key":"2890_CR11","doi-asserted-by":"crossref","unstructured":"Chitnis, R., Hajiaghayi, M., Kortsarz, G.: Fixed-parameter and approximation algorithms: A new look. In: International Symposium on Parameterized and Exact Computation, pp. 110\u2013122. Cham: Springer International Publishing (2013)","DOI":"10.1007\/978-3-319-03898-8_11"},{"key":"2890_CR12","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. In: Technical report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh (1976)"},{"issue":"1","key":"2890_CR13","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"2890_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer-Verlag, New York (1999)"},{"issue":"2","key":"2890_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror, M., Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23(2), 141\u2013145 (1989)","journal-title":"Transp. Sci."},{"key":"2890_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.03.014","volume":"95","author":"WA Ellegood","year":"2020","unstructured":"Ellegood, W.A., Solomon, S., North, J., Campbell, J.F.: School bus routing problem: Contemporary trends and research directions. Omega 95, 102056 (2020)","journal-title":"Omega"},{"key":"2890_CR17","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin (2006)"},{"issue":"3","key":"2890_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1057\/palgrave.jors.2601817","volume":"56","author":"Z Fu","year":"2005","unstructured":"Fu, Z., Eglese, R., Li, L.Y.: A new tabu search heuristic for the open vehicle routing problem. J. Oper. Res. Soc. 56(3), 267\u2013274 (2005)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"2890_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"J Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.: Analysis of Christofides\u2019 heuristic: Some paths are more difficult than cycles. Oper. Res. Lett. 10(5), 291\u2013295 (1991)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"2890_CR20","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1287\/ijoc.2021.0193","volume":"35","author":"X Lai","year":"2023","unstructured":"Lai, X., Xu, L., Xu, Z., Du, Y.: An approximation algorithm for k-depot split delivery vehicle routing problem. INFORMS J. Comput. 35(5), 1179\u20131194 (2023)","journal-title":"INFORMS J. Comput."},{"key":"2890_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00291-015-0408-9","volume":"38","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz, E., Exp\u00f3sito-Izquierdo, C., Taheripour, S., Vo\u00df, S.: An improved formulation for the multi-depot open vehicle routing problem. OR Spectrum 38, 175\u2013187 (2016)","journal-title":"OR Spectrum"},{"issue":"12","key":"2890_CR22","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1057\/palgrave.jors.2602345","volume":"58","author":"AN Letchford","year":"2007","unstructured":"Letchford, A.N., Lysgaard, J., Eglese, R.W.: A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Oper. Res. Soc. 58(12), 1642\u20131651 (2007)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"2890_CR23","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/ijoc.2.1.64","volume":"2","author":"C-L Li","year":"1990","unstructured":"Li, C.-L., Simchi-Levi, D.: Worst-case analysis of heuristics for multidepot capacitated vehicle routing problems. ORSA J. Comput. 2(1), 64\u201373 (1990)","journal-title":"ORSA J. Comput."},{"issue":"10","key":"2890_CR24","doi-asserted-by":"publisher","first-page":"2918","DOI":"10.1016\/j.cor.2005.11.018","volume":"34","author":"F Li","year":"2007","unstructured":"Li, F., Golden, B., Wasil, E.: The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & Operations Research 34(10), 2918\u20132930 (2007)","journal-title":"Computers & Operations Research"},{"key":"2890_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.101955","volume":"140","author":"J Li","year":"2020","unstructured":"Li, J., Qin, H., Baldacci, R., Zhu, W.: Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows. Transportation Research Part E: Logistics and Transportation Review 140, 101955 (2020)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"2890_CR26","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ejor.2014.04.008","volume":"238","author":"A L\u00f3pez-S\u00e1nchez","year":"2014","unstructured":"L\u00f3pez-S\u00e1nchez, A., Hern\u00e1ndez-D\u00edaz, A.G., Vigo, D., Caballero, R., Molina, J.: A multi-start algorithm for a balanced real-world open vehicle routing problem. Eur. J. Oper. Res. 238(1), 104\u2013113 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2890_CR27","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1287\/trsc.2015.0666","volume":"51","author":"Z Luo","year":"2017","unstructured":"Luo, Z., Qin, H., Zhu, W., Lim, A.: Branch and price and cut for the split-delivery vehicle routing problem with time windows and linear weight-related cost. Transp. Sci. 51(2), 668\u2013687 (2017)","journal-title":"Transp. Sci."},{"issue":"1","key":"2890_CR28","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"key":"2890_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103286","volume":"179","author":"P Mo","year":"2023","unstructured":"Mo, P., Yao, Y., D\u2019Ariano, A., Liu, Z.: The vehicle routing problem with underground logistics: Formulation and algorithm. Transportation Research Part E: Logistics and Transportation Review 179, 103286 (2023)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"2890_CR30","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","volume":"79","author":"JR Montoya-Torres","year":"2015","unstructured":"Montoya-Torres, J.R., Franco, J.L., Isaza, S.N., Jim\u00e9nez, H.F., Herazo-Padilla, N.: A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering 79, 115\u2013129 (2015)","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"2890_CR31","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1016\/j.ejor.2017.12.010","volume":"267","author":"O Ozturk","year":"2018","unstructured":"Ozturk, O., Patrick, J.: An optimization model for freight transport using urban rail transit. Eur. J. Oper. Res. 267(3), 1110\u20131121 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"2890_CR32","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Mineola, New York (1998)"},{"issue":"1","key":"2890_CR33","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TASE.2006.872110","volume":"4","author":"S Rathinam","year":"2007","unstructured":"Rathinam, S., Sengupta, R., Darbha, S.: A resource allocation algorithm for multivehicle systems with nonholonomic constraints. IEEE Trans. Autom. Sci. Eng. 4(1), 98\u2013104 (2007)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"3","key":"2890_CR34","first-page":"315","volume":"12","author":"E Romanowicz","year":"2004","unstructured":"Romanowicz, E., Grabowski, A.: The hall marriage theorem. Formalized Mathematics 12(3), 315\u2013320 (2004)","journal-title":"The hall marriage theorem. Formalized Mathematics"},{"key":"2890_CR35","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.cie.2019.05.002","volume":"133","author":"E Ruiz","year":"2019","unstructured":"Ruiz, E., Soto-Mendoza, V., Barbosa, A.E.R., Reyes, R.: Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm. Computers & Industrial Engineering 133, 207\u2013219 (2019)","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"2890_CR36","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","volume":"51","author":"D Sariklis","year":"2000","unstructured":"Sariklis, D., Powell, S.: A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society 51(5), 564\u2013573 (2000)","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"2890_CR37","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/net.3230110212","volume":"11","author":"L Schrage","year":"1981","unstructured":"Schrage, L.: Formulation and structure of more complex\/realistic routing and scheduling problems. Networks 11(2), 229\u2013232 (1981)","journal-title":"Networks"},{"key":"2890_CR38","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cie.2017.03.022","volume":"107","author":"M Soto","year":"2017","unstructured":"Soto, M., Sevaux, M., Rossi, A., Reinholz, A.: Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem. Computers & Industrial Engineering 107, 211\u2013222 (2017)","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"2890_CR39","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1057\/palgrave.jors.2601848","volume":"56","author":"CD Tarantilis","year":"2005","unstructured":"Tarantilis, C.D., Ioannou, G., Kiranoudis, C.T., Prastacos, G.P.: Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society 56(5), 588\u2013596 (2005)","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"2890_CR40","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1287\/trsc.2021.1101","volume":"56","author":"F Torres","year":"2022","unstructured":"Torres, F., Gendreau, M., Rei, W.: Vehicle routing with stochastic supply of crowd vehicles and time windows. Transp. Sci. 56(3), 631\u2013653 (2022)","journal-title":"Transp. Sci."},{"key":"2890_CR41","doi-asserted-by":"crossref","unstructured":"Toth, P., & Vigo, D.: Vehicle routing: problems, methods, and applications (2nd ed.). Society for Industrial and Applied Mathematics (2014)","DOI":"10.1137\/1.9781611973594"},{"key":"2890_CR42","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.tre.2014.06.006","volume":"69","author":"H Wang","year":"2014","unstructured":"Wang, H., Du, L., Ma, S.: Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake. Transportation Research Part E: Logistics and Transportation Review 69, 160\u2013179 (2014)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"5","key":"2890_CR43","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.orl.2023.07.003","volume":"51","author":"J Wu","year":"2023","unstructured":"Wu, J., Cheng, Y., Yang, Z., Chu, F.: A 3\/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints. Oper. Res. Lett. 51(5), 473\u2013476 (2023)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"2890_CR44","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10878-023-01104-8","volume":"47","author":"J Wu","year":"2024","unstructured":"Wu, J., Yang, Z., Zhang, G., Cheng, Y.: An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem. J. Comb. Optim. 47(2), 7 (2024)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"2890_CR45","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1287\/ijoc.2015.0650","volume":"27","author":"Z Xu","year":"2015","unstructured":"Xu, Z., Rodrigues, B.: A 3\/2-approximation algorithm for the multiple TSP with a fixed number of depots. INFORMS J. Comput. 27(4), 636\u2013645 (2015)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"2890_CR46","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.ejor.2016.08.054","volume":"257","author":"Z Xu","year":"2017","unstructured":"Xu, Z., Rodrigues, B.: An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem. Eur. J. Oper. Res. 257(3), 735\u2013745 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2890_CR47","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.orl.2011.03.002","volume":"39","author":"Z Xu","year":"2011","unstructured":"Xu, Z., Xu, L., Rodrigues, B.: An analysis of the extended Christofides heuristic for the k-depot TSP. Oper. Res. Lett. 39(3), 218\u2013223 (2011)","journal-title":"Oper. Res. Lett."},{"key":"2890_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2019.05.002","volume":"34","author":"Y Yang","year":"2019","unstructured":"Yang, Y., Liu, Z.: Approximating the multiple-depot multiple-terminal Hamiltonian path problem. Discret. Optim. 34, 100545 (2019)","journal-title":"Discret. Optim."},{"issue":"4","key":"2890_CR49","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1007\/s11590-021-01774-5","volume":"16","author":"Y Yang","year":"2022","unstructured":"Yang, Y., Liu, Z., Yu, W.: Approximation algorithms for the k-depots Hamiltonian path problem. Optimization Letters 16(4), 1215\u20131234 (2022)","journal-title":"Optimization Letters"},{"key":"2890_CR50","doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: A 1.5-approximation for path tsp. In: Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1539\u20131549. SIAM (2019)","DOI":"10.1137\/1.9781611975482.93"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02890-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02890-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02890-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T12:01:47Z","timestamp":1767009707000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02890-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,29]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["2890"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02890-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,12,29]]},"assertion":[{"value":"12 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2025","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 conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}],"article-number":"73"}}