{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:41Z","timestamp":1740122441721,"version":"3.37.3"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-17-CE25- 0006"],"award-info":[{"award-number":["ANR-17-CE25- 0006"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10878-024-01125-x","type":"journal-article","created":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T12:01:22Z","timestamp":1713096082000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem"],"prefix":"10.1007","volume":"47","author":[{"given":"Ibrahima","family":"Diarrassouba","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8032-087X","authenticated-orcid":false,"given":"Youssouf","family":"Hadhbi","sequence":"additional","affiliation":[]},{"given":"A. Ridha","family":"Mahjoub","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,14]]},"reference":[{"key":"1125_CR1","volume-title":"Performance assessment and modeling of flexible optical networks","author":"D Amar","year":"2016","unstructured":"Amar D (2016) Performance assessment and modeling of flexible optical networks. Thesis, Institut National des T\u00e9l\u00e9communications"},{"key":"1125_CR2","doi-asserted-by":"crossref","unstructured":"Bertero F, Bianchetti M, Marenco J (2018) Integer programming models for the routing and spectrum allocation problem. In: Official Journal of the Spanish Society of Statistics and Operations Research, pp 465\u2013488","DOI":"10.1007\/s11750-018-0483-6"},{"key":"1125_CR3","unstructured":"Brun B, Baraketi S (2014) Routing and wavelength assignment in optical networks, pp 1\u201341. https:\/\/hal.archives-ouvertes.fr\/hal-01062321"},{"key":"1125_CR4","doi-asserted-by":"crossref","unstructured":"Cai A, Shen G, Peng L, Zukerman M (2013) Novel node-arc model and multiiteration heuristics for static routing and spectrum assignment in elastic optical networks. J Lightw Technol 3402\u20133413","DOI":"10.1109\/JLT.2013.2282696"},{"key":"1125_CR5","doi-asserted-by":"crossref","unstructured":"Chen X, Guo J, Zhu Z, Proietti R, Castro A, Yoo SJB (2018) Deep-RMSA: a deep-reinforcement-learning routing, modulation and spectrum assignment agent for elastic optical networks. In: Optical fiber communications conference and exposition (OFC), pp 1\u20133","DOI":"10.1364\/OFC.2018.W4F.2"},{"key":"1125_CR6","doi-asserted-by":"crossref","unstructured":"Chlamtac I, Ganz A, Karmi G (1992) Lightpath communications: an approach to high bandwidth optical WAN\u2019s. IEEE Trans Commun 1171\u20131182","DOI":"10.1109\/26.153361"},{"key":"1125_CR7","unstructured":"Chouman H, Gravey A, Gravey P, Hadhbi Y, Kerivin H, Morvan M, Wagler A (2021) Impact of RSA optimization objectives on optical network state, pp 1\u20137. https:\/\/hal.uca.fr\/hal-03155966"},{"key":"1125_CR8","unstructured":"Chouman H, Luay A, Colares R, Gravey A Gravey P, Kerivin H, Morvan M, Wagler A (2021) Assessing the health of flexgrid optical networks, pp 1\u20137. https:\/\/hal.archives-ouvertes.fr\/hal-03123302"},{"key":"1125_CR9","doi-asserted-by":"crossref","unstructured":"Christodoulopoulos K, Manousakis K, Varvarigos E (2010) Offline routing and wavelength assignment in transparent wdm networks. In: Networking, IEEE\/ACM transactions, pp 1557\u20131570","DOI":"10.1109\/TNET.2010.2044585"},{"key":"1125_CR10","doi-asserted-by":"crossref","unstructured":"Christodoulopoulos K, Tomkos I, Varvarigos EA (2011) Elastic bandwidth allocation in flexible OFDM-based optical networks. In: Lightwave technology, pp 1354\u20131366","DOI":"10.1109\/JLT.2011.2125777"},{"key":"1125_CR11","unstructured":"Colares R, Kerivin H, Wagler A (2021) An extended formulation for the Constraint Routing and Spectrum Assignment Problem in Elastic Optical Networks, pp 1\u201316. https:\/\/hal.uca.fr\/hal-03156189"},{"key":"1125_CR12","unstructured":"Cplex II (2020) V12. 9: User\u2019s manual for CPLEX. Int Bus Mach Corp 46(53):157"},{"key":"1125_CR13","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H Crowder","year":"1983","unstructured":"Crowder H, Johnson EL, Padberg MW (1983) Solving large scale zero-one linear programming problems. Oper Res 31:803\u2013834","journal-title":"Oper Res"},{"key":"1125_CR14","doi-asserted-by":"crossref","unstructured":"Diarrassouba I, Hadhbi Y (2022) The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm. In: Ljubi\u0107 I, Barahona F, Dey SS, Mahjoub AR (eds) Combinatorial optimization, ISCO, Lecture Notes in Computer Science, vol 13526","DOI":"10.1007\/978-3-031-18530-4_3"},{"issue":"1","key":"1125_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"1125_CR16","doi-asserted-by":"crossref","unstructured":"Ding Z, Xu Z, Zeng X, Ma T, Yang F (2014) Hybrid routing and spectrum assignment algorithms based on distance-adaptation combined coevolution and heuristics in elastic optical networks. J Opt Eng 1\u201310","DOI":"10.1117\/1.OE.53.4.046105"},{"key":"1125_CR17","doi-asserted-by":"crossref","unstructured":"Dror M (1994) Note on the complexity of the shortest path models for column generation in VRPTW. J Oper Res 977\u2013978","DOI":"10.1287\/opre.42.5.977"},{"key":"1125_CR18","doi-asserted-by":"crossref","unstructured":"Dumitrescu I, Boland N (2001) Algorithms for the weight constrained shortest path problem. Int Trans Oper Res 15\u201329","DOI":"10.1111\/1475-3995.00003"},{"key":"1125_CR19","unstructured":"Gamrath G, Anderson D, Bestuzheva K, Chen WK, Eifler L, Gasse M, Gemander P, Gleixner A, Gottwald L, Halbig K, Hendel G, Hojny C, Koch T, Bodic L, Maher PJ, Matter F, Miltenberger M, M\u00fchmer E, M\u00fcller B, Pfetsch ME, Schl\u00f6sser F, Serrano F, Shinano Y, Tawfik C, Vigerske S, Wegscheider F, Weninger D, Witzig J (March 2020) The SCIP Optimization Suite 7.0. http:\/\/www.optimization-online.org\/DB_HTML\/2020\/03\/7705.html"},{"key":"1125_CR20","doi-asserted-by":"crossref","unstructured":"Goldberg AV, Tarjan RE (1986) A new approach to the maximum flow problem. In: Proceedings of the Eighteenth Annual Association for Computing Machinery Symposium on Theory of Computing, pp 136\u2013146","DOI":"10.1145\/12130.12144"},{"key":"1125_CR21","doi-asserted-by":"crossref","unstructured":"Gong L, Zhou X, Lu W, Zhu Z (2012) A two-population based evolutionary approach for optimizing routing, modulation and spectrum assignments (RMSA) in O-OFDM networks. IEEE Commun Lett 1520\u20131523","DOI":"10.1109\/LCOMM.2012.070512.120740"},{"key":"1125_CR22","doi-asserted-by":"crossref","unstructured":"Goscien R, Walkowiak K, Klinkowski M (2015) Tabu search algorithm, routing, modulation and spectrum allocation, anycast traffic, elastic optical networks. J Comput Netw 148\u2013165","DOI":"10.1016\/j.comnet.2014.12.004"},{"key":"1125_CR23","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Stable sets in graphs. In: Geometric algorithms and combinatorial optimization. algorithms and combinatorics, vol 2. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-97881-4"},{"key":"1125_CR24","unstructured":"Gurobi Optimization LLC (2021) Gurobi optimizer reference manual. https:\/\/www.gurobi.com"},{"key":"1125_CR25","doi-asserted-by":"crossref","unstructured":"Gu R, Yang Z, Ji Y (2020) Machine learning for intelligent optical networks: a comprehensive survey. J CoRR 1\u201342","DOI":"10.1016\/j.jnca.2020.102576"},{"key":"1125_CR26","unstructured":"Hadhbi Y (2022) The constrained-routing and spectrum assignment problem: polyhedral analysis and algorithms. PhD thesis at Clermont Auvergne University"},{"key":"1125_CR27","doi-asserted-by":"crossref","unstructured":"Hadhbi Y, Kerivin H, Wagler A (2019) A novel integer linear programming model for routing and spectrum assignment in optical networks. In: Federated conference on computer science and information systems (FedCSIS) , pp 127\u2013134","DOI":"10.15439\/2019F188"},{"key":"1125_CR28","doi-asserted-by":"crossref","unstructured":"Hai DH, Hoang KM (2017) An efficient genetic algorithm approach for solving routing and spectrum assignment problem. J Recent Adv Signal Process 187\u2013192","DOI":"10.1109\/SIGTELCOM.2017.7849820"},{"key":"1125_CR29","doi-asserted-by":"crossref","unstructured":"Hai DH, Morvan M, Gravey P (2017) Combining heuristic and exact approaches for solving the routing and spectrum assignment problem. J Iet Optoelectron 65\u201372","DOI":"10.1049\/iet-opt.2017.0013"},{"key":"1125_CR30","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1049\/iet-opt.2017.0013","volume":"12","author":"DT Hai","year":"2017","unstructured":"Hai DT, Morvan M, Gravey P (2017) Combining heuristic and exact approaches for solving the routing and spectrum assignment problem. IET Optoelectron 12:65\u201372","journal-title":"IET Optoelectron"},{"key":"1125_CR31","doi-asserted-by":"crossref","unstructured":"He S, Qiu Y, Xu J (2020) Invalid-resource-aware spectrum assignment for advanced-reservation traffic in elastic optical network. In: Sensors","DOI":"10.3390\/s20154190"},{"key":"1125_CR32","doi-asserted-by":"crossref","unstructured":"Jaumard B, Daryalal M (2016) Scalable elastic optical path networking models. In: 18th international conference transparent optical networks (ICTON), pp 1\u20134","DOI":"10.1109\/ICTON.2016.7550385"},{"key":"1125_CR33","doi-asserted-by":"crossref","unstructured":"Jiang R, Feng M, Shen J (2017) An defragmentation scheme for extending the maximal unoccupied spectrum block in elastic optical networks. In: 16th international conference on optical communications and networks (ICOCN), pp 1\u20133","DOI":"10.1109\/ICOCN.2017.8121494"},{"key":"1125_CR34","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations: proceedings of a symposium on the complexity of computer computations, held March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, pp 85\u201394","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1125_CR35","doi-asserted-by":"crossref","unstructured":"Klabjan D, Nemhauser GL, Tovey C (1998) The complexity of cover inequality separation. Oper Res Lett 35\u201340","DOI":"10.1016\/S0167-6377(98)00025-X"},{"key":"1125_CR36","doi-asserted-by":"crossref","unstructured":"Klinkowski M, Pedro J, Careglio D, Pioro M, Pires J, Monteiro P, Sole-Pareta J (2010) An overview of routing methods in optical burst switching networks. Opt Switch Network 41\u201353","DOI":"10.1016\/j.osn.2010.01.001"},{"key":"1125_CR37","doi-asserted-by":"crossref","unstructured":"Klinkowski M, Pioro M, Zotkiewicz M, Ruiz M, Velasco L (2014) Valid inequalities for the routing and spectrum allocation problem in elastic optical networks. In: 16th international conference on transparent optical networks (ICTON), pp 1\u20135","DOI":"10.1109\/ICTON.2014.6876290"},{"key":"1125_CR38","doi-asserted-by":"crossref","unstructured":"Klinkowski M, Pioro M, Zotkiewicz M, Ruiz M, Velasco L (2015) A simulated annealing heuristic for a branch and price-based routing and spectrum allocation algorithm in elastic optical networks. In: Intelligent data engineering and automated learning \u2013 IDEAL, Springer International Publishing, pp 290\u2013299","DOI":"10.1007\/978-3-319-24834-9_35"},{"key":"1125_CR39","doi-asserted-by":"crossref","unstructured":"Klinkowski M, Pi\u00f3ro M, \u017botkiewicz M, Walkowiak K, Ruiz M, Velasco L (2015) Spectrum allocation problem in elastic optical networks - A branch-and-price approach. In: 17th international conference on transparent optical networks (ICTON), pp 1\u20135","DOI":"10.1109\/ICTON.2015.7193482"},{"key":"1125_CR40","doi-asserted-by":"crossref","unstructured":"Klinkowski M, Walkowiak K (2011) Routing and spectrum assignment in spectrum sliced elastic optical path network. IEEE Commun Lett 884\u2013886","DOI":"10.1109\/LCOMM.2011.060811.110281"},{"key":"1125_CR41","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s11107-020-00918-4","volume":"41","author":"F Lezama","year":"2021","unstructured":"Lezama F, Martinez-Herrera AF, Castanon G, Del-Valle-Soto C, Sarmiento AM, Munoz de Cote A (2021) Solving routing and spectrum allocation problems in flexgrid optical networks using pre-computing strategies. J Photon Netw Commun 41:17\u201335","journal-title":"J Photon Netw Commun"},{"key":"1125_CR42","unstructured":"Liu Z, Rouskas GN (2013) Link selection algorithms for link-based ilps and applications to rwa in mesh networks. In: Optical network design and modeling (ONDM), 17th international conference. IEEE, pp 59\u201364"},{"key":"1125_CR43","unstructured":"Liu L, Yin S, Zhang Z, Chu Y, Huang S (2019) A Monte Carlo based routing and spectrum assignment agent for elastic optical networks. In: Asia communications and photonics conference (ACP), pp 1\u20133"},{"key":"1125_CR44","doi-asserted-by":"crossref","unstructured":"Lohani V, Sharma A, Singh YN (2019) Routing, modulation and spectrum assignment using an AI based algorithm. In: 11th international conference on communication systems & networks (COMSNETS), pp 266\u2013271","DOI":"10.1109\/COMSNETS.2019.8711172"},{"key":"1125_CR45","doi-asserted-by":"crossref","unstructured":"Lopez V, Velasco L (2016) Elastic optical networks: architectures, technologies, and control. Springer Publishing Company, Incorporated","DOI":"10.1007\/978-3-319-30174-7"},{"key":"1125_CR46","doi-asserted-by":"crossref","unstructured":"Mesquita LAJ, Assis K, Santos AF, Alencar M, Almeida RC (2018) A routing and spectrum assignment heuristic for elastic optical networks under incremental traffic. In: SBFoton international optics and photonics conference (SBFoton IOPC), pp 1\u20135","DOI":"10.1109\/SBFoton-IOPC.2018.8610937"},{"key":"1125_CR47","doi-asserted-by":"crossref","unstructured":"Nemhauser GL, Sigismondi G (1992) A strong cutting plane\/branch-and-bound algorithm for node packing. J Oper Res Soc 443\u2013457","DOI":"10.1057\/palgrave.jors.0430507"},{"key":"1125_CR48","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, Hoboken"},{"key":"1125_CR49","doi-asserted-by":"crossref","unstructured":"Nguyen DM, Ngoc LA, Huong PTV, Son NH, Hai DT (2019) An efficient column generation approach for solving the routing and spectrum assignment problem in elastic optical networks. In: the 6th NAFOSTED conference on information and computer science (NICS), Hanoi, Vietnam, pp 130\u2013135","DOI":"10.1109\/NICS48868.2019.9023831"},{"key":"1125_CR50","unstructured":"Orlowski S, Pi\u00f3ro M, Tomaszewski A, Wess\u00e4ly R (2007) SNDlib 1.0-survivable network design library. In: Proceedings of the 3rd international network optimization conference (INOC 2007), Spa, Belgium"},{"key":"1125_CR51","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"MW Padberg","year":"1973","unstructured":"Padberg MW (1973) On the facial structure of set packing polyhedra. Math Program 5:199\u2013215","journal-title":"Math Program"},{"key":"1125_CR52","unstructured":"Pedro H, Fernandes da Silva, Kerivin H, Nant JP, Wagler A (2022) A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties. In: The international network optimization conference (INOC), pp 1\u20136"},{"key":"1125_CR53","volume-title":"Optical networks: a practical perspective","author":"R Ramaswami","year":"2009","unstructured":"Ramaswami R (2009) Optical networks: a practical perspective, 3rd edn. Morgan Kaufmann Publishers Inc","edition":"3"},{"key":"1125_CR54","doi-asserted-by":"crossref","unstructured":"Ramaswami R, Sivarajan K, Sasaki G (1993) Multiwavelength lightwave networks for computer communication. In: IEEE communications magazine, pp 78\u201388","DOI":"10.1109\/35.186364"},{"key":"1125_CR55","doi-asserted-by":"crossref","unstructured":"Rebennack S, Reinelt G, Pardalos PM (2012) A tutorial on branch and cut algorithms for the maximum stable set problem. J Int Trans Oper Res 161\u2013199","DOI":"10.1111\/j.1475-3995.2011.00805.x"},{"key":"1125_CR56","doi-asserted-by":"crossref","unstructured":"Ruiz M, Pioro M, Zotkiewicz M, Klinkowski M, Velasco L (2013) Column generation algorithm for RSA problems in flexgrid optical networks. Photon Netw Commun 53\u201364","DOI":"10.1007\/s11107-013-0408-0"},{"key":"1125_CR57","unstructured":"Ruiz M, Pioro M, Zotkiewicz M, Klinkowski M, Velasco L (2020) A hybrid meta-heuristic approach for optimization of routing and spectrum assignment in Elastic Optical Network (EON). J Enterprise Inform Syst 11\u201324"},{"key":"1125_CR58","doi-asserted-by":"crossref","unstructured":"Salani M, Rottondi C, Tornatore M (2019) Routing and spectrum assignment integrating machine-learning-based QoT estimation in elastic optical networks. In: IEEE INFOCOM - IEEE Conference on Computer Communications, p 173846","DOI":"10.1109\/INFOCOM.2019.8737413"},{"key":"1125_CR59","doi-asserted-by":"crossref","unstructured":"Shirazipourazad S, Zhou C, Derakhshandeh Z, Sen A (2013) On routing and spectrum allocation in spectrum-sliced optical networks. In: Proceedings IEEE INFOCOM, pp 385\u2013389","DOI":"10.1109\/INFCOM.2013.6566800"},{"key":"1125_CR60","doi-asserted-by":"crossref","unstructured":"Shiva-Kumar M, Sreenivasa-Kumar P (2002) Static lightpath establishment in wdm networksnew ilp formulations and heuristic algorithms. Comput Commun 109\u2013114","DOI":"10.1016\/S0140-3664(01)00339-5"},{"key":"1125_CR61","doi-asserted-by":"crossref","unstructured":"Simonis H (2011) Solving the static design routing and wavelength assignment problem. In: Recent advances in constraints. Springer, pp 59\u201375","DOI":"10.1007\/978-3-642-19486-3_4"},{"key":"1125_CR62","unstructured":"Siregar H, Takagi H, Zhang Y (2003) Efficient routing and wavelength assignment in wavelength-routed optical networks. In: Proceedings of 7th Asia-Pacific Network Operations and Mgmt Symposium, pp 116\u2013127"},{"key":"1125_CR63","doi-asserted-by":"crossref","unstructured":"Skorin-Kapov N (2007) Routing and wavelength assignment in optical networks using bin packing based algorithms. Eur J Oper Res 1167\u20131179","DOI":"10.1016\/j.ejor.2006.01.003"},{"key":"1125_CR64","doi-asserted-by":"crossref","unstructured":"Talebi S, Alam F , Katib I, Khamis M, Salama R, Rouskas GN (2014) Spectrum management techniques for elastic optical networks: a survey. In: Optical switching and networking, pp 34\u201348","DOI":"10.1016\/j.osn.2014.02.003"},{"key":"1125_CR65","doi-asserted-by":"crossref","unstructured":"Velasco L, Klinkowski M, Ruiz M, Comellas J (2012) Modeling the routing and spectrum allocation problem for flexgrid optical networks. Photon Network Commun 177\u2013186","DOI":"10.1007\/s11107-012-0378-7"},{"key":"1125_CR66","unstructured":"Zang H, Jue JP, Mukherjee B et al (2000) A review of routing and wavelength assignment approaches for wavelength-routed optical wdm networks. In: Optical networks magazine, pp 47\u201360"},{"key":"1125_CR67","doi-asserted-by":"crossref","unstructured":"Zhang Y, Xin J, Li X, Huang S (2020) Overview on routing and resource allocation based machine learning in optical networks. J Opt Fiber Technol 1\u201321","DOI":"10.1016\/j.yofte.2020.102355"},{"key":"1125_CR68","doi-asserted-by":"crossref","unstructured":"Zotkiewicz M, Pioro M, Ruiz M, Klinkowski M, Velasco L (2013) Optimization models for flexgrid elastic optical networks. In: 15th international conference on transparent optical networks (ICTON), pp 1\u20134","DOI":"10.1109\/ICTON.2013.6602691"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01125-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01125-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01125-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T13:10:01Z","timestamp":1715951401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01125-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,14]]},"references-count":68,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1125"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01125-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,4,14]]},"assertion":[{"value":"21 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2024","order":2,"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 not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"56"}}