{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T22:25:08Z","timestamp":1768083908997,"version":"3.49.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"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":["Comput Manag Sci"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10287-023-00494-8","type":"journal-article","created":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T12:02:28Z","timestamp":1704369748000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Primal-dual gradient methods for searching network equilibria in combined models with nested choice structure and capacity constraints"],"prefix":"10.1007","volume":"21","author":[{"given":"Meruza","family":"Kubentayeva","sequence":"first","affiliation":[]},{"given":"Demyan","family":"Yarmoshik","sequence":"additional","affiliation":[]},{"given":"Mikhail","family":"Persiianov","sequence":"additional","affiliation":[]},{"given":"Alexey","family":"Kroshnin","sequence":"additional","affiliation":[]},{"given":"Ekaterina","family":"Kotliarova","sequence":"additional","affiliation":[]},{"given":"Nazarii","family":"Tupitsa","sequence":"additional","affiliation":[]},{"given":"Dmitry","family":"Pasechnyuk","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Shvetsov","sequence":"additional","affiliation":[]},{"given":"Leonid","family":"Baryshev","sequence":"additional","affiliation":[]},{"given":"Alexey","family":"Shurupov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,4]]},"reference":[{"issue":"1","key":"494_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/trsc.33.1.80","volume":"33","author":"T Abrahamsson","year":"1999","unstructured":"Abrahamsson T, Lundqvist L (1999) Formulation and estimation of combined network equilibrium models with applications to stockholm. Transp Sci 33(1):80\u2013100","journal-title":"Transp Sci"},{"key":"494_CR2","unstructured":"Altschuler J, Weed J, Rigollet P (2017) Near-linear time approxfimation algorithms for optimal transport via Sinkhorn iteration. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in neural information processing systems 30, pp. 1961\u20131971. Curran Associates, Inc., arXiv:1705.09634. http:\/\/papers.nips.cc\/paper\/6792-near-linear-time-approximation-algorithms-for-optimal-transport-via-sinkhorn-iteration.pdf"},{"key":"494_CR3","doi-asserted-by":"publisher","unstructured":"Anikin A, Dorn Y, Nesterov Y (2020) Computational methods for the stable dynamic model, pp 280\u2013294 . https:\/\/doi.org\/10.1007\/978-3-030-38603-0_21","DOI":"10.1007\/978-3-030-38603-0_21"},{"issue":"1","key":"494_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/trsc.24.1.58","volume":"24","author":"Y Arezki","year":"1990","unstructured":"Arezki Y, Van Vliet D (1990) A full analytical implementation of the PARTAN\/Frank-Wolfe algorithm for equilibrium assignment. Transp Sci 24(1):58\u201362","journal-title":"Transp Sci"},{"issue":"1","key":"494_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo L (1966) Minimization of functions having Lipschitz continuous first partial derivatives. Pac J Math 16(1):1\u20133","journal-title":"Pac J Math"},{"issue":"3","key":"494_CR6","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1080\/23249935.2020.1722279","volume":"16","author":"A Babazadeh","year":"2020","unstructured":"Babazadeh A, Javani B, Gentile G, Florian M (2020) Reduced gradient algorithm for user equilibrium traffic assignment problem. Transp A: Transp Sci 16(3):1111\u20131135. https:\/\/doi.org\/10.1080\/23249935.2020.1722279","journal-title":"Transp A: Transp Sci"},{"key":"494_CR7","unstructured":"Beckmann MJ, McGuire CB, Winsten CB (1956) Studies in the economics of transportation. Technical report"},{"issue":"4","key":"494_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1061\/(ASCE)0733-9488(2002)128:4(169)","volume":"128","author":"D Boyce","year":"2002","unstructured":"Boyce D (2002) Is the sequential travel forecasting paradigm counterproductive? J Urban Plan Develop 128(4):169\u2013183","journal-title":"J Urban Plan Develop"},{"issue":"9","key":"494_CR9","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1068\/a151219","volume":"15","author":"DE Boyce","year":"1983","unstructured":"Boyce DE, Chon KS, Lee YJ, Lin K, LeBlanc LJ (1983) Implementation and computational issues for combined models of location, destination, mode, and route choice. Environ Plan A 15(9):1219\u20131230","journal-title":"Environ Plan A"},{"key":"494_CR10","first-page":"65","volume":"1443","author":"DE Boyce","year":"1994","unstructured":"Boyce DE, Zhang Y-F, Lupa MR (1994) Introducing feedback into four-step travel forecasting procedure versus equilibrium solution of combined model. Transport Res Record 1443:65","journal-title":"Transport Res Record"},{"issue":"4","key":"494_CR11","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1093\/comjnl\/14.4.422","volume":"14","author":"RP Brent","year":"1971","unstructured":"Brent RP (1971) An algorithm with guaranteed convergence for finding a zero of a function. Comput J 14(4):422\u2013425","journal-title":"Comput J"},{"key":"494_CR12","doi-asserted-by":"publisher","unstructured":"Cabannes T, Glista E, Dwarakanath K, Rao X, Veeravalli T, Bayen AM (2019) Sensitivity analysis and relaxation of the static traffic assignment problem with capacity constraints. In: 2019 IEEE 58th conference on decision and control (CDC), pp 2214\u20132219. https:\/\/doi.org\/10.1109\/CDC40024.2019.9030149","DOI":"10.1109\/CDC40024.2019.9030149"},{"issue":"3","key":"494_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1080\/0144164042000335805","volume":"25","author":"J De Cea","year":"2005","unstructured":"De Cea J, Fern\u00e1ndez JE, Dekock V, Soto A (2005) Solving network equilibrium problems on multimodal urban transportation networks with multiple user classes. Transp Rev 25(3):293\u2013317","journal-title":"Transp Rev"},{"key":"494_CR14","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2002)128:1(31)","author":"A Chen","year":"2002","unstructured":"Chen A, Jayakrishnan R, Tsai W (2002) Faster Frank-Wolfe traffic assignment with new flow update scheme. J Transp Eng ASCE. https:\/\/doi.org\/10.1061\/(ASCE)0733-947X(2002)128:1(31)","journal-title":"J Transp Eng ASCE"},{"key":"494_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2020.102809","volume":"120","author":"X Chen","year":"2020","unstructured":"Chen X, Liu Z, Zhang K, Wang Z (2020) A parallel computing approach to solve traffic assignment using path-based gradient projection algorithm. Transp Res Part C: Emerg Technol 120:102809. https:\/\/doi.org\/10.1016\/j.trc.2020.102809","journal-title":"Transp Res Part C: Emerg Technol"},{"issue":"2","key":"494_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jtte.2017.05.014","volume":"5","author":"Y-L Chu","year":"2018","unstructured":"Chu Y-L (2018) Implementation of a new network equilibrium model of travel choices. J Traffic Transp Eng (English Edition) 5(2):105\u2013115. https:\/\/doi.org\/10.1016\/j.jtte.2017.05.014","journal-title":"J Traffic Transp Eng (English Edition)"},{"key":"494_CR17","unstructured":"Chudak FA, Dos Santos\u00a0Eleuterio V, Nesterov Y (2007) Static traffic assignment problem: a comparison between Beckmann (1956) and Nesterov & de Palma (1998) models. In: 7th swiss transport research conference . ETH"},{"key":"494_CR18","unstructured":"Cuturi M (2013) Sinkhorn distances: lightspeed computation of optimal transportation distances"},{"issue":"1","key":"494_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW et al (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"494_CR20","doi-asserted-by":"crossref","unstructured":"Dios\u00a0Ort\u00fazar J, Willumsen LG (2011) Modelling Transport, (4th edn). Wiley","DOI":"10.1002\/9781119993308"},{"issue":"1","key":"494_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0041-1647(76)90100-3","volume":"10","author":"SP Evans","year":"1976","unstructured":"Evans SP (1976) Derivation and analysis of some models for combining trip distribution and assignment. Transp Res 10(1):37\u201357. https:\/\/doi.org\/10.1016\/0041-1647(76)90100-3","journal-title":"Transp Res"},{"key":"494_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102832","volume":"164","author":"Y Fan","year":"2022","unstructured":"Fan Y, Ding J, Liu H, Wang Y, Long J (2022) Large-scale multimodal transportation network models and algorithms-part i: the combined mode split and traffic assignment problem. Transp Res Part E: Logist Transp Rev 164:102832","journal-title":"Transp Res Part E: Logist Transp Rev"},{"issue":"3","key":"494_CR23","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1287\/trsc.28.3.182","volume":"28","author":"E Fern\u00e1ndez","year":"1994","unstructured":"Fern\u00e1ndez E, De Cea J, Florian M, Cabrera E (1994) Network equilibrium models with combined modes. Transp Sci 28(3):182\u2013192","journal-title":"Transp Sci"},{"issue":"4","key":"494_CR24","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0041-1647(78)90065-5","volume":"12","author":"M Florian","year":"1978","unstructured":"Florian M, Nguyen S (1978) A combined trip distribution modal split and trip assignment model. Transp Res 12(4):241\u2013246","journal-title":"Transp Res"},{"issue":"1\u20132","key":"494_CR25","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res Logist Q 3(1\u20132):95\u2013110","journal-title":"Naval Res Logist Q"},{"issue":"2","key":"494_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0191-2615(84)90029-8","volume":"18","author":"M Fukushima","year":"1984","unstructured":"Fukushima M (1984) A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Transp Res Part B: Methodol 18(2):169\u2013177","journal-title":"Transp Res Part B: Methodol"},{"key":"494_CR27","doi-asserted-by":"publisher","first-page":"143","DOI":"10.5604\/01.3001.0016.0020","volume":"63","author":"J Gao","year":"2022","unstructured":"Gao J, Wang Y, Zhou J (2022) A study on two-stage selection model of tourism destination at the scale of urban agglomerations. Arch Transp 63:143\u2013157. https:\/\/doi.org\/10.5604\/01.3001.0016.0020","journal-title":"Arch Transp"},{"issue":"4","key":"494_CR28","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1134\/S0965542516040084","volume":"56","author":"AV Gasnikov","year":"2016","unstructured":"Gasnikov AV, Gasnikova EV, Nesterov YE, Chernov AV (2016) Efficient numerical methods for entropy-linear programming problems. Comput Math Math Phys 56(4):514\u2013524. https:\/\/doi.org\/10.1134\/S0965542516040084","journal-title":"Comput Math Math Phys"},{"issue":"1","key":"494_CR29","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1134\/S0965542518010050","volume":"58","author":"AV Gasnikov","year":"2018","unstructured":"Gasnikov AV, Nesterov YE (2018) Universal method for stochastic composite optimization problems. Comput Math Math Phys 58(1):48\u201364","journal-title":"Comput Math Math Phys"},{"key":"494_CR30","unstructured":"Gasnikov A, Dvurechensky P, Kamzolov D, Nesterov Y, Spokoiny V, Stetsyuk P, Suvorikova A, Chernov A (2015) Universal method with inexact oracle and its applications for searching equillibriums in multistage transport problems. arXiv preprint arXiv:1506.00292"},{"key":"494_CR31","unstructured":"Gasnikov A, Nesterov Y (2016) Universal fast gradient method for stochastic composit optimization problems. arXiv:1604.05275"},{"key":"494_CR32","unstructured":"Guminov S, Dvurechensky P, Tupitsa N, Gasnikov A (2021) On a combination of alternating minimization and Nesterov\u2019s momentum. In: International conference on machine learning, pp 3886\u20133898. PMLR"},{"key":"494_CR33","unstructured":"Jaggi M (2013) Revisiting frank\u2013wolfe: projection-free sparse convex optimization. In: Proceedings of the 30th international conference on machine learning, pp 427\u2013435"},{"issue":"11","key":"494_CR34","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.3390\/math9111217","volume":"9","author":"M Kubentayeva","year":"2021","unstructured":"Kubentayeva M, Gasnikov A (2021) Finding equilibria in the traffic assignment problem with primal-dual gradient methods for stable dynamics model and Beckmann model. Mathematics 9(11):1217","journal-title":"Mathematics"},{"issue":"4","key":"494_CR35","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/trsc.19.4.445","volume":"19","author":"LJ LeBlanc","year":"1985","unstructured":"LeBlanc LJ, Helgason RV, Boyce DE (1985) Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transp Sci 19(4):445\u2013462","journal-title":"Transp Sci"},{"key":"494_CR36","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.trb.2018.08.004","volume":"117","author":"Z Liu","year":"2018","unstructured":"Liu Z, Chen X, Meng Q, Kim I (2018) Remote park-and-ride network equilibrium model and its applications. Transp Res Part B: Methodol 117:37\u201362. https:\/\/doi.org\/10.1016\/j.trb.2018.08.004","journal-title":"Transp Res Part B: Methodol"},{"issue":"1","key":"494_CR37","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov Y (2009) Primal-dual subgradient methods for convex problems. Math Program 120(1):221\u2013259. https:\/\/doi.org\/10.1007\/s10107-007-0149-x","journal-title":"Math Program"},{"issue":"1","key":"494_CR38","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov Y (2015) Universal gradient methods for convex optimization problems. Math Program 152(1):381\u2013404. https:\/\/doi.org\/10.1007\/s10107-014-0790-0","journal-title":"Math Program"},{"issue":"3","key":"494_CR39","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1023\/A:1025350419398","volume":"3","author":"Y Nesterov","year":"2003","unstructured":"Nesterov Y, De Palma A (2003) Stationary dynamic solutions in congested transportation networks: summary and perspectives. Netw Spat Econ 3(3):371\u2013395","journal-title":"Netw Spat Econ"},{"key":"494_CR40","doi-asserted-by":"crossref","unstructured":"Nesterov Y (2004) Introductory lectures on convex optimization: a basic course. Kluwer Academic Publishers, Massachusetts","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"494_CR41","volume-title":"Urban travel demand modeling: from individual choices to general equilibrium","author":"N Oppenheim","year":"1995","unstructured":"Oppenheim N et al (1995) Urban travel demand modeling: from individual choices to general equilibrium. Wiley, New York"},{"key":"494_CR42","unstructured":"Patriksson M (2015) The traffic assignment problem: models and methods. Courier Dover Publications"},{"key":"494_CR43","unstructured":"Pedregosa F, Negiar G, Askari A, Jaggi M (2020) Linearly convergent Frank\u2013Wolfe with backtracking line-search. In: international conference on artificial intelligence and statistics. Proceedings of machine learning research"},{"key":"494_CR44","unstructured":"Sheffi Y (1985) Urban transportation networks, vol 6, Prentice-Hall, Englewood Cliffs, NJ"},{"key":"494_CR45","doi-asserted-by":"publisher","first-page":"195","DOI":"10.2307\/2040061","volume":"45","author":"R Sinkhorn","year":"1974","unstructured":"Sinkhorn R (1974) Diagonal equivalence to matrices with prescribed row and column sums II. Proc Am Math Soc 45:195\u2013198. https:\/\/doi.org\/10.2307\/2040061","journal-title":"Proc Am Math Soc"},{"key":"494_CR46","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.trb.2019.01.018","volume":"122","author":"M Smith","year":"2019","unstructured":"Smith M, Huang W, Viti F, Tamp\u00e8re CMJ, Lo HK (2019) Quasi-dynamic traffic assignment with spatial queueing, control and blocking back. Transp Res Part B: Methodol 122:140\u2013166. https:\/\/doi.org\/10.1016\/j.trb.2019.01.018","journal-title":"Transp Res Part B: Methodol"},{"key":"494_CR47","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-22629-9_8","volume-title":"Math Optim Theor Oper Res","author":"FS Stonyakin","year":"2019","unstructured":"Stonyakin FS, Dvinskikh D, Dvurechensky P, Kroshnin A, Kuznetsova O, Agafonov A, Gasnikov A, Tyurin A, Uribe CA, Pasechnyuk D, Artamonov S (2019) Gradient methods for problems with inexact model of the objective. In: Khachay M, Kochetov Y, Pardalos P (eds) Math Optim Theor Oper Res. Springer, Cham, pp 97\u2013114"},{"key":"494_CR48","unstructured":"Transportation Networks for Research Core Team (2023) Transportation networks for research. https:\/\/github.com\/bstabler\/TransportationNetworks. Accessed: 2023-04-30"},{"key":"494_CR49","unstructured":"US Bureau of Public Roads (1964) Traffic assignment manual. Department of Commerce, urban planning division, Washington D.C"},{"issue":"1","key":"494_CR50","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/TPWRS.2018.2867176","volume":"34","author":"X Wang","year":"2019","unstructured":"Wang X, Shahidehpour M, Jiang C, Li Z (2019) Coordinated planning strategy for electric vehicle charging stations and coupled traffic-electric networks. IEEE Transact Power Syst 34(1):268\u2013279. https:\/\/doi.org\/10.1109\/TPWRS.2018.2867176","journal-title":"IEEE Transact Power Syst"},{"issue":"3","key":"494_CR51","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1080\/23249935.2021.1942303","volume":"18","author":"Z Wang","year":"2022","unstructured":"Wang Z, Zhang K, Chen X, Wang M, Liu R, Liu Z (2022) An improved parallel block coordinate descent method for the distributed computing of traffic assignment problem. Transp A: Transp Sci 18(3):1376\u20131400. https:\/\/doi.org\/10.1080\/23249935.2021.1942303","journal-title":"Transp A: Transp Sci"},{"key":"494_CR52","unstructured":"Wilson AG (1969) The use of entropy maximising models, in the theory of trip distribution, mode split and route split. J Transp Econ Polic 108\u2013126"},{"key":"494_CR53","doi-asserted-by":"publisher","DOI":"10.13140\/RG.2.2.18661.09447","author":"J Xie","year":"2017","unstructured":"Xie J, Nie Y, Liu X (2017) A greedy path-based algorithm for traffic assignment. Transp Res Record. https:\/\/doi.org\/10.13140\/RG.2.2.18661.09447","journal-title":"Transp Res Record"},{"issue":"1","key":"494_CR54","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1061\/(ASCE)UP.1943-5444.0000130","volume":"139","author":"C Yang","year":"2013","unstructured":"Yang C, Chen A, Xu X (2013) Improved partial linearization algorithm for solving the combined travel-destination-mode-route choice problem. J Urban Plan Develop 139(1):22\u201332","journal-title":"J Urban Plan Develop"},{"key":"494_CR55","doi-asserted-by":"publisher","first-page":"036119811983795","DOI":"10.1177\/0361198119837956","volume":"2673","author":"A Zarrinmehr","year":"2019","unstructured":"Zarrinmehr A, Aashtiani H, Nie Y, Azizian H (2019) Complementarity formulation and solution algorithm for auto-transit assignment problem. Transp Res Record J Transp Res Board 2673:036119811983795. https:\/\/doi.org\/10.1177\/0361198119837956","journal-title":"Transp Res Record J Transp Res Board"},{"key":"494_CR56","doi-asserted-by":"publisher","first-page":"158862","DOI":"10.1109\/ACCESS.2020.3019301","volume":"8","author":"J-X Zhu","year":"2020","unstructured":"Zhu J-X, Luo Q-Y, Guan X-Y, Yang J-L, Bing X (2020) A traffic assignment approach for multi-modal transportation networks considering capacity constraints and route correlations. IEEE Access 8:158862\u2013158874","journal-title":"IEEE Access"},{"issue":"1","key":"494_CR57","first-page":"175","volume":"28","author":"H Zokaei Aashtiani","year":"2021","unstructured":"Zokaei Aashtiani H, Poorzahedy H, Nourinejad M (2021) Wardrop\u2019s first principle: extension for capacitated networks. Sci Iran 28(1):175\u2013191","journal-title":"Sci Iran"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00494-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-023-00494-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-023-00494-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T12:11:12Z","timestamp":1719058272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-023-00494-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,4]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["494"],"URL":"https:\/\/doi.org\/10.1007\/s10287-023-00494-8","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,4]]},"assertion":[{"value":"1 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2024","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"15"}}