{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T04:21:55Z","timestamp":1783052515739,"version":"3.54.6"},"reference-count":52,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100020771","name":"Natural Science Foundation for Young Scientists of Shanxi Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020771","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62573389"],"award-info":[{"award-number":["62573389"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62173311"],"award-info":[{"award-number":["62173311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.ejor.2026.04.028","type":"journal-article","created":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T15:26:35Z","timestamp":1776871595000},"page":"96-110","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning-based fast alternating direction method of multipliers for multi-agent path finding using temporary variable-fixing"],"prefix":"10.1016","volume":"334","author":[{"given":"Xiangchao","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1024-4135","authenticated-orcid":false,"given":"Jianbin","family":"Xin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1837-4380","authenticated-orcid":false,"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yihui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"D\u2019Ariano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.ejor.2019.06.010","article-title":"Worst case analysis of relax and fix heuristics for lot-sizing problems","volume":"279","author":"Absi","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10589-021-00338-8","article-title":"An inexact accelerated stochastic ADMM for separable convex optimization","volume":"81","author":"Bai","year":"2022","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10915-024-02518-0","article-title":"A new insight on augmented Lagrangian method with applications in machine learning","volume":"99","author":"Bai","year":"2024","journal-title":"Journal of Scientific Computing"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b4","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10589-024-00643-y","article-title":"An inexact ADMM for separable nonconvex and nonsmooth optimization","volume":"90","author":"Bai","year":"2025","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/j.ejor.2026.04.028_b5","doi-asserted-by":"crossref","unstructured":"Barer, M., Sharon, G., Stern, R., & Felner, A. (2014). Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem. vol. 5, In Proceedings of the international symposium on combinatorial search (pp. 19\u201327).","DOI":"10.1609\/socs.v5i1.18315"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.028_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"Boyd","year":"2011","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"key":"10.1016\/j.ejor.2026.04.028_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.robot.2023.104480","article-title":"Multi-agent planning and coordination for automated aircraft ground handling","volume":"167","author":"Chen","year":"2023","journal-title":"Robotics and Autonomous Systems"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.028_b8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","article-title":"The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent","volume":"155","author":"Chen","year":"2016","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2026.04.028_b9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.trc.2018.04.013","article-title":"Distributed model predictive control for vessel train formations of cooperative multi-vessel systems","volume":"92","author":"Chen","year":"2018","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"6","key":"10.1016\/j.ejor.2026.04.028_b10","doi-asserted-by":"crossref","first-page":"2156","DOI":"10.1109\/LCSYS.2020.3044873","article-title":"Online decentralized decision making with inequality constraints: An ADMM approach","volume":"5","author":"Chen","year":"2021","journal-title":"IEEE Control Systems Letters"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b11","doi-asserted-by":"crossref","first-page":"2666","DOI":"10.1109\/LRA.2021.3062803","article-title":"PRIMAL2: Pathfinding via reinforcement and imitation multi-agent learning - lifelong","volume":"6","author":"Damani","year":"2021","journal-title":"IEEE Robotics and Automation Letters"},{"key":"10.1016\/j.ejor.2026.04.028_b12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.ijpe.2019.03.009","article-title":"Modeling and solving a sugarcane harvest front scheduling problem","volume":"213","author":"de \u00c1vila Ribeiro Junqueira","year":"2019","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/ijoc.2023.0017","article-title":"An enhanced alternating direction method of multipliers-based interior point method for linear and conic optimization","volume":"37","author":"Deng","year":"2025","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"10.1016\/j.ejor.2026.04.028_b14","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1287\/trsc.2020.0988","article-title":"Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models","volume":"54","author":"Desaulniers","year":"2020","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.028_b15","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.ejor.2023.11.045","article-title":"Sharing in construction projects \u2014 On determining optimal container assignments for the on-site accommodation of trades","volume":"315","author":"Dienstknecht","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.028_b16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.028_b17","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1109\/TPEL.2013.2261094","article-title":"Optimal trajectory control of LLC resonant converters for soft start-up","volume":"29","author":"Feng","year":"2014","journal-title":"IEEE Transactions on Power Electronics"},{"key":"10.1016\/j.ejor.2026.04.028_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2023.104081","article-title":"An ADMM-based dual decomposition mechanism for integrating crew scheduling and rostering in an urban rail transit line","volume":"149","author":"Feng","year":"2023","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2026.04.028_b19","doi-asserted-by":"crossref","unstructured":"Ferrati, M., & Pallottino, L. (2013). A time expanded network based algorithm for safe and efficient distributed multi-agent coordination. In 52nd IEEE conference on decision and control (pp. 2805\u20132810).","DOI":"10.1109\/CDC.2013.6760308"},{"key":"10.1016\/j.ejor.2026.04.028_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105520","article-title":"A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem","volume":"137","author":"Friske","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.028_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2020.102960","article-title":"A priority-based ADMM approach for flexible train scheduling problems","volume":"123","author":"Gao","year":"2021","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2026.04.028_b22","series-title":"Gurobi Optimizer Reference Manual","author":"Gurobi Optimization, LLC","year":"2024"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b23","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ijpe.2009.08.022","article-title":"A fix-and-optimize approach for the multi-level capacitated lot sizing problem","volume":"123","author":"Helber","year":"2010","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2026.04.028_b25","doi-asserted-by":"crossref","unstructured":"Huang, Z., Cheng, Y., Shi, L., & Shan, M. (2025). Self-Assembly Planning for Modular Robots via Multi-Agent Path Finding on Time-Expanded Networks. In 2025 IEEE\/RSJ international conference on intelligent robots and systems (pp. 8660\u20138666).","DOI":"10.1109\/IROS60139.2025.11246674"},{"key":"10.1016\/j.ejor.2026.04.028_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105809","article-title":"Branch-and-cut-and-price for multi-agent path finding","volume":"144","author":"Lam","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.028_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2024.104724","article-title":"A hierarchical solution framework for dynamic and conflict-free AGV scheduling in an automated container terminal","volume":"165","author":"Li","year":"2024","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2026.04.028_b28","doi-asserted-by":"crossref","unstructured":"Li, Q., Gama, F., Ribeiro, A., & Prorok, A. (2020). Graph Neural Networks for Decentralized Multi-Robot Path Planning. In 2020 IEEE\/RSJ international conference on intelligent robots and systems (pp. 11785\u201311792).","DOI":"10.1109\/IROS45743.2020.9341668"},{"issue":"9","key":"10.1016\/j.ejor.2026.04.028_b29","doi-asserted-by":"crossref","first-page":"4940","DOI":"10.1109\/TFUZZ.2024.3389045","article-title":"Distributed fault diagnosis for heterogeneous multiagent systems: A hybrid knowledge-based and data-driven method","volume":"32","author":"Li","year":"2024","journal-title":"IEEE Transactions on Fuzzy Systems"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.028_b30","doi-asserted-by":"crossref","first-page":"5533","DOI":"10.1109\/LRA.2021.3077863","article-title":"Message-aware graph attention networks for large-scale multi-robot path planning","volume":"6","author":"Li","year":"2021","journal-title":"IEEE Robotics and Automation Letters"},{"issue":"14","key":"10.1016\/j.ejor.2026.04.028_b31","doi-asserted-by":"crossref","first-page":"12353","DOI":"10.1609\/aaai.v35i14.17466","article-title":"EECBS: A bounded-suboptimal search for multi-agent path finding","volume":"35","author":"Li","year":"2021","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"issue":"13","key":"10.1016\/j.ejor.2026.04.028_b32","doi-asserted-by":"crossref","first-page":"11272","DOI":"10.1609\/aaai.v35i13.17344","article-title":"Lifelong multi-agent path finding in large-scale warehouses","volume":"35","author":"Li","year":"2021","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"10.1016\/j.ejor.2026.04.028_b33","series-title":"Learning to accelerate approximate methods for solving integer programming via early fixing","author":"Li","year":"2022"},{"issue":"5","key":"10.1016\/j.ejor.2026.04.028_b34","doi-asserted-by":"crossref","first-page":"2948","DOI":"10.1287\/opre.2021.2164","article-title":"Online linear programming: Dual convergence, new algorithms, and regret bounds","volume":"70","author":"Li","year":"2022","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.028_b35","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1016\/j.ejor.2023.04.008","article-title":"An alternating direction method of multipliers for solving user equilibrium problem","volume":"310","author":"Liu","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.028_b36","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1287\/trsc.2023.1207","article-title":"Human-robot cooperation: coordinating autonomous mobile robots and human order pickers","volume":"57","author":"L\u00f6ffler","year":"2023","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b37","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ejor.2015.03.030","article-title":"A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern","volume":"245","author":"Mesquita","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2026.04.028_b38","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1109\/TRO.2005.853489","article-title":"Distributed route planning for multiple mobile robots using an augmented Lagrangian decomposition and coordination technique","volume":"21","author":"Nishi","year":"2005","journal-title":"IEEE Transactions on Robotics"},{"key":"10.1016\/j.ejor.2026.04.028_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103752","article-title":"Priority inheritance with backtracking for iterative multi-agent path finding","volume":"310","author":"Okumura","year":"2022","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b40","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.ejor.2014.02.018","article-title":"A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company","volume":"237","author":"Oliveira","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.028_b41","series-title":"2011 IEEE international conference on robotics and automation","first-page":"5628","article-title":"SIPP: Safe interval path planning for dynamic environments","author":"Phillips","year":"2011"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.028_b42","doi-asserted-by":"crossref","first-page":"2378","DOI":"10.1109\/LRA.2019.2903261","article-title":"PRIMAL: Pathfinding via reinforcement and imitation multi-agent learning","volume":"4","author":"Sartoretti","year":"2019","journal-title":"IEEE Robotics and Automation Letters"},{"key":"10.1016\/j.ejor.2026.04.028_b43","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","article-title":"Conflict-based search for optimal multi-agent pathfinding","volume":"219","author":"Sharon","year":"2015","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.028_b44","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1609\/socs.v10i1.18510","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","volume":"10","author":"Stern","year":"2021","journal-title":"Proceedings of the International Symposium on Combinatorial Search"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.028_b45","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.2019.0990","article-title":"On the efficiency of random permutation for ADMM and coordinate descent","volume":"45","author":"Sun","year":"2020","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.028_b46","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1016\/j.ejor.2022.03.029","article-title":"Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty","volume":"303","author":"Thevenin","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.028_b47","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.ejor.2021.05.053","article-title":"Integrated rolling stock deadhead routing and timetabling in urban rail transit lines","volume":"298","author":"Wang","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"10.1016\/j.ejor.2026.04.028_b48","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1109\/TPAMI.2018.2845842","article-title":"\u2113p-Box ADMM: A versatile framework for integer programming","volume":"41","author":"Wu","year":"2018","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/j.ejor.2026.04.028_b49","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.trb.2019.09.009","article-title":"ADMM-based problem decomposition scheme for vehicle routing problem with time windows","volume":"129","author":"Yao","year":"2019","journal-title":"Transportation Research Part B: Methodological"},{"issue":"5","key":"10.1016\/j.ejor.2026.04.028_b50","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1109\/TRO.2016.2593448","article-title":"Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics","volume":"32","author":"Yu","year":"2016","journal-title":"IEEE Transactions on Robotics"},{"key":"10.1016\/j.ejor.2026.04.028_b51","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.trb.2019.08.001","article-title":"Solving cyclic train timetabling problem through model reformulation: extended time-space network construct and alternating direction method of multipliers methods","volume":"128","author":"Zhang","year":"2019","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.028_b52","doi-asserted-by":"crossref","first-page":"2082","DOI":"10.1287\/moor.2021.1200","article-title":"Distributed stochastic optimization with large delays","volume":"47","author":"Zhou","year":"2022","journal-title":"Mathematics of Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726003784?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726003784?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T04:08:17Z","timestamp":1783051697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726003784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0377221726003784"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.028","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Learning-based fast alternating direction method of multipliers for multi-agent path finding using temporary variable-fixing","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.028","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}