{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T20:16:32Z","timestamp":1778703392400,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T00:00:00Z","timestamp":1771891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T00:00:00Z","timestamp":1771891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["PPM 676\/17"],"award-info":[{"award-number":["PPM 676\/17"]}],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["311074\/2023-5"],"award-info":[{"award-number":["311074\/2023-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100022823","name":"Centro Federal de Educa\u00e7\u00e3o Tecnol\u00f3gica de Minas Gerais","doi-asserted-by":"publisher","award":["NA"],"award-info":[{"award-number":["NA"]}],"id":[{"id":"10.13039\/100022823","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Instituto Federal de Educa\u00e7\u00e3o, Ci\u00eancia e Tecnologia do Sul de Minas Gerais","award":["NA"],"award-info":[{"award-number":["NA"]}]},{"DOI":"10.13039\/501100009730","name":"Universidade Federal de Ouro Preto","doi-asserted-by":"publisher","award":["NA"],"award-info":[{"award-number":["NA"]}],"id":[{"id":"10.13039\/501100009730","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This work introduces the Single Source Capacitated Partial Set Covering Location Problem (SSCPSCLP). Given a set of potential capacitated facilities and a set of customers with their demands, this problem consists of determining the facilities to be opened and the customers to be served to minimize the total cost of opening facilities, ensuring that at least a minimum amount of the total demand is served, only covered customers can be served, the capacity of the facilities is not exceeded, and each customer can be served by at most one facility. This work introduces a mathematical model for the problem and, since it is NP-hard, develops an algorithm based on the Tabu Search (TS) metaheuristic to handle large-scale instances. The TS algorithm explores the problem\u2019s solution space through two neighborhoods, one of which is incorporated into a local search procedure that is periodically applied. The initial solution is generated either by a constructive greedy heuristic or by solving the linear relaxation of the SSCPSCLP. Four TS variants were proposed, differing in the method for generating the initial solution and in the use of local search. The results of computational experiments on instances from the literature show that the TS algorithm finds high-quality solutions in a shorter runtime than a mathematical programming-based solver and that the version using initial solutions from the linear relaxation of the problem and local search performs best.<\/jats:p>","DOI":"10.1007\/s10732-026-09581-w","type":"journal-article","created":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T09:34:38Z","timestamp":1771925678000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Tabu Search algorithm for the single source capacitated partial set covering location problem"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8211-2123","authenticated-orcid":false,"given":"F\u00e1bio Pires","family":"Mour\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7801-0087","authenticated-orcid":false,"given":"Elisangela Martins","family":"de S\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7831-6740","authenticated-orcid":false,"given":"S\u00e9rgio Ricardo","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7141-357X","authenticated-orcid":false,"given":"Marcone Jamilson Freitas","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,24]]},"reference":[{"issue":"2","key":"9581_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0305-0483(96)00058-8","volume":"25","author":"B Adenso-Diaz","year":"1997","unstructured":"Adenso-Diaz, B., Rodriguez, F.: A simple search heuristic for the MCLP: Application to the location of ambulance bases in a rural region. Omega 25(2), 181\u2013187 (1997)","journal-title":"Omega"},{"key":"9581_CR2","doi-asserted-by":"publisher","first-page":"117863292412636","DOI":"10.1177\/11786329241263699","volume":"17","author":"K Bando","year":"2024","unstructured":"Bando, K., Ohashi, K., Fujiwara, K., et al.: The capacitated maximal covering location problem improves access to stroke treatment: a cross-sectional simulation study. Health Services Insights 17, 11786329241263700 (2024)","journal-title":"Health Services Insights"},{"key":"9581_CR3","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/s12597-014-0190-5","volume":"52","author":"S Basu","year":"2015","unstructured":"Basu, S., Sharma, M., Ghosh, P.S.: Metaheuristic applications on discrete facility location problems: a survey. Opsearch 52, 530\u2013561 (2015)","journal-title":"Opsearch"},{"issue":"2","key":"9581_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10732-013-9235-9","volume":"20","author":"N Bilal","year":"2014","unstructured":"Bilal, N., Galinier, P., Guibault, F.: An iterated-tabu-search heuristic for a variant of the partial set covering problem. Journal of Heuristics 20(2), 143\u2013164 (2014)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"9581_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ejor.2021.02.037","volume":"295","author":"C B\u00fcsing","year":"2021","unstructured":"B\u00fcsing, C., Comis, M., Schmidt, E., et al.: Robust strategic planning for mobile medical units with steerable and unsteerable demands. Eur. J. Oper. Res. 295(1), 34\u201350 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"9581_CR6","unstructured":"Calamita, A., Ljubi\u0107, I., Palagi, L.: Benders decomposition for congested partial set covering location with uncertain demand. arXiv, arXiv: 2401.12625 (2024)"},{"key":"9581_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109858","volume":"188","author":"S Ceschia","year":"2024","unstructured":"Ceschia, S., Schaerf, A.: Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities. Computers & Industrial Engineering 188, 109858 (2024)","journal-title":"Computers & Industrial Engineering"},{"key":"9581_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2018.12.001","volume":"99","author":"D Chauhan","year":"2019","unstructured":"Chauhan, D., Unnikrishnan, A., Figliozzi, M.: Maximum coverage capacitated facility location problem with range constrained drones. Transportation Research Part C: Emerging Technologies 99, 1\u201318 (2019)","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"1","key":"9581_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2023.04.044","volume":"311","author":"L Chen","year":"2023","unstructured":"Chen, L., Chen, S.J., Chen, W.K., et al.: Efficient presolving methods for solving maximal covering and partial set covering location problems. Eur. J. Oper. Res. 311(1), 73\u201387 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"9581_CR10","unstructured":"Chung, C., Schilling, D., Carbone, R.: The capacitated maximal covering problem: A heuristic. In: Proceedings of Fourteenth Annual Pittsburgh Conference on Modeling and Simulation, pp 1423\u20131428 (1983)"},{"issue":"1","key":"9581_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1111\/j.1435-5597.1974.tb00902.x","volume":"32","author":"R Church","year":"1974","unstructured":"Church, R., ReVelle, C.: The maximal covering location problem. Pap. Reg. Sci. 32(1), 101\u2013118 (1974). https:\/\/doi.org\/10.1111\/j.1435-5597.1974.tb00902.x","journal-title":"Pap. Reg. Sci."},{"key":"9581_CR12","unstructured":"Church, R., Somogyi, C.: Optimizing service and access coverage. In: North American Meetings of the Regional Science Association in Philadelphia, PA (1985)"},{"issue":"3","key":"9581_CR13","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.ejor.2018.12.021","volume":"275","author":"JF Cordeau","year":"2019","unstructured":"Cordeau, J.F., Furini, F., Ljubi\u0107, I.: Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur. J. Oper. Res. 275(3), 882\u2013896 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"9581_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-56082-8_3","volume":"1","author":"J Current","year":"2002","unstructured":"Current, J., Daskin, M., Schilling, D., et al.: Discrete network location models. Facility location: Applications and Theory 1, 81\u2013118 (2002)","journal-title":"Facility location: Applications and Theory"},{"issue":"2","key":"9581_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1068\/b150153","volume":"15","author":"JR Current","year":"1988","unstructured":"Current, J.R., Storbeck, J.E.: Capacitated covering models. Environ. Plann. B. Plann. Des. 15(2), 153\u2013163 (1988)","journal-title":"Environ. Plann. B. Plann. Des."},{"issue":"3","key":"9581_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1111\/j.1538-4632.1999.tb00979.x","volume":"31","author":"MS Daskin","year":"1999","unstructured":"Daskin, M.S., Owen, S.H.: Two new location covering problems: The partial p-center problem and the partial set covering problem. Geogr. Anal. 31(3), 217\u2013235 (1999)","journal-title":"Geogr. Anal."},{"issue":"3","key":"9581_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10732-023-09524-9","volume":"30","author":"GB de Almeida","year":"2024","unstructured":"de Almeida, G.B., de S\u00e1, E.M., de Souza, S.R., et al.: A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems. Journal of Heuristics 30(3), 145\u2013172 (2024)","journal-title":"Journal of Heuristics"},{"issue":"8","key":"9581_CR18","doi-asserted-by":"publisher","first-page":"B-378","DOI":"10.1287\/mnsc.18.8.B378","volume":"18","author":"M Devine","year":"1972","unstructured":"Devine, M., Lesso, W.: Models for the minimum cost development of offshore oil fields. Management Science 18(8), B-378 (1972)","journal-title":"Management Science"},{"issue":"1","key":"9581_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJBSR.2016.073685","volume":"10","author":"SK Elkady","year":"2016","unstructured":"Elkady, S.K., Abdelsalam, H.M.: A modified multi-objective particle swarm optimisation algorithm for healthcare facility planning. Int. J. Bus. Syst. Res. 10(1), 1\u201322 (2016)","journal-title":"Int. J. Bus. Syst. Res."},{"issue":"1","key":"9581_CR20","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.cie.2011.08.020","volume":"62","author":"RZ Farahani","year":"2012","unstructured":"Farahani, R.Z., Asgari, N., Heidari, N., et al.: Covering problems in facility location: A review. Computers & Industrial Engineering 62(1), 368\u2013407 (2012)","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"9581_CR21","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1111\/gean.12172","volume":"50","author":"T Ferrari","year":"2018","unstructured":"Ferrari, T., Camara, M.V.O., Nassi, C.D., et al.: Analysis of the location of rescue ambulance dispatch bases: a case study in rio de janeiro, brazil. Geogr. Anal. 50(4), 397\u2013421 (2018)","journal-title":"Geogr. Anal."},{"issue":"2","key":"9581_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0966-8349(97)00015-6","volume":"5","author":"M Gendreau","year":"1997","unstructured":"Gendreau, M., Laporte, G., Semet, F.: Solving an ambulance location model by tabu search. Locat. Sci. 5(2), 75\u201388 (1997)","journal-title":"Locat. Sci."},{"issue":"5","key":"9581_CR23","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers & operations research 13(5), 533\u2013549 (1986)","journal-title":"Computers & operations research"},{"issue":"2","key":"9581_CR24","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2014.04.007","volume":"238","author":"G Guastaroba","year":"2014","unstructured":"Guastaroba, G., Speranza, M.G.: A heuristic for bilp problems: the single source capacitated facility location problem. Eur. J. Oper. Res. 238(2), 438\u2013450 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9581_CR25","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"SL Hakimi","year":"1965","unstructured":"Hakimi, S.L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13(3), 462\u2013475 (1965)","journal-title":"Oper. Res."},{"key":"9581_CR26","first-page":"70","volume-title":"Congress on numerical methods in combinatorial optimization","author":"P Hansen","year":"1986","unstructured":"Hansen, P.: The steepest ascent mildest descent heuristic for combinatorial programming. In: Congress on numerical methods in combinatorial optimization, pp. 70\u2013145. Capri, Italy (1986)"},{"key":"9581_CR27","unstructured":"Hogan, K., ReVelle, C.: The capacitated maximal covering problem. In: ORSA\/TIMS meeting in Boston, MA (1985)"},{"issue":"5","key":"9581_CR28","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"JG Klincewicz","year":"1986","unstructured":"Klincewicz, J.G., Luss, H.: A lagrangian relaxation heuristic for capacitated facility location with single-source constraints. Journal of the Operational Research Society 37(5), 495\u2013500 (1986)","journal-title":"Journal of the Operational Research Society"},{"key":"9581_CR29","doi-asserted-by":"crossref","unstructured":"Laporte, G., Nickel, S., da Gama, FS.: Location Science. Springer Cham (2019)","DOI":"10.1007\/978-3-030-32177-2"},{"issue":"4","key":"9581_CR30","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/j.cie.2010.01.005","volume":"58","author":"JM Lee","year":"2010","unstructured":"Lee, J.M., Lee, Y.H.: Tabu-based heuristics for the generalized hierarchical covering location problem. Computers & Industrial Engineering 58(4), 638\u2013645 (2010)","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"9581_CR31","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1108\/DTA-08-2021-0205","volume":"56","author":"X Liu","year":"2022","unstructured":"Liu, X., Zhou, Y., Yin, M., et al.: An argentine ant system algorithm for partial set covering problem. Data Technologies and Applications 56(5), 762\u2013781 (2022)","journal-title":"Data Technologies and Applications"},{"key":"9581_CR32","volume-title":"The irace package: User guide","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., C\u00e1ceres, L.P., Dubois-Lacoste, J., et al.: The irace package: User guide. IRIDIA, Institut de Recherches Interdisciplinaires et de D\u00e9veloppements en Intelligence Artificielle (2016)"},{"key":"9581_CR33","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., et al.: The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives 3, 43\u201358 (2016)","journal-title":"Operations Research Perspectives"},{"key":"9581_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.124020","volume":"275","author":"XD Medrano-G\u00f3mez","year":"2020","unstructured":"Medrano-G\u00f3mez, X.D., Ferreira, D., Toso, E.A., et al.: Using the maximal covering location problem to design a sustainable recycling network. J. Clean. Prod. 275, 124020 (2020)","journal-title":"J. Clean. Prod."},{"key":"9581_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106751","volume":"170","author":"N Niroumandrad","year":"2024","unstructured":"Niroumandrad, N., Lahrichi, N., Lodi, A.: Learning tabu search algorithms: A scheduling application. Computers & Operations Research 170, 106751 (2024)","journal-title":"Computers & Operations Research"},{"key":"9581_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cstp.2025.101435","volume":"20","author":"P Oranpairoj","year":"2025","unstructured":"Oranpairoj, P., Karoonsoontawong, A., Kanitpong, K.: Coverage evaluation of public electric vehicle charging stations in bangkok, thailand using location-allocation model. Case Studies on Transport Policy 20, 101435 (2025)","journal-title":"Case Studies on Transport Policy"},{"issue":"1","key":"9581_CR37","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF02097800","volume":"18","author":"H Pirkul","year":"1989","unstructured":"Pirkul, H., Schilling, D.: The capacitated maximal covering location problem with backup service. Ann. Oper. Res. 18(1), 141\u2013154 (1989)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9581_CR38","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/mnsc.37.2.233","volume":"37","author":"H Pirkul","year":"1991","unstructured":"Pirkul, H., Schilling, D.A.: The maximal covering location problem with capacities on total workload. Manage. Sci. 37(2), 233\u2013248 (1991)","journal-title":"Manage. Sci."},{"issue":"1","key":"9581_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2003.11.032","volume":"165","author":"CS ReVelle","year":"2005","unstructured":"ReVelle, C.S., Eiselt, H.A.: Location analysis: A synthesis and survey. Eur. J. Oper. Res. 165(1), 1\u201319 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9581_CR40","unstructured":"Somogyi, C., Church, R.: Solving the capacitated maximal covering location problem. DraftManuscript (1985)"},{"issue":"6","key":"9581_CR41","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"C Toregas","year":"1971","unstructured":"Toregas, C., Swain, R., ReVelle, C., et al.: The location of emergency service facilities. Oper. Res. 19(6), 1363\u20131373 (1971)","journal-title":"Oper. Res."},{"issue":"2","key":"9581_CR42","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/tgis.12608","volume":"24","author":"J Xu","year":"2020","unstructured":"Xu, J., Murray, A., Wang, Z., et al.: Challenges in applying capacitated covering models. Trans. GIS 24(2), 268\u2013290 (2020)","journal-title":"Trans. GIS"},{"key":"9581_CR43","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yang, Y., Tong, H., et\u00a0al.: Learning-based problem reduction for large-scale uncapacitated facility location problems. In: 2024 IEEE Congress on Evolutionary Computation (CEC), IEEE, pp 1\u20138 (2024)","DOI":"10.1109\/CEC60901.2024.10611785"},{"issue":"1","key":"9581_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-025-09552-7","volume":"31","author":"Y Zhang","year":"2025","unstructured":"Zhang, Y., He, J., Zhou, Y., et al.: An effective population-based approach for the partial set covering problem. Journal of Heuristics 31(1), 1\u201332 (2025)","journal-title":"Journal of Heuristics"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-026-09581-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-026-09581-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-026-09581-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T14:21:52Z","timestamp":1773066112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-026-09581-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,24]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["9581"],"URL":"https:\/\/doi.org\/10.1007\/s10732-026-09581-w","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,24]]},"assertion":[{"value":"3 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"10"}}