{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T22:04:55Z","timestamp":1766181895939,"version":"3.40.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T00:00:00Z","timestamp":1657843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T00:00:00Z","timestamp":1657843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"coordena\u00e7\u00e3o de aperfei\u00e7oamento de pessoal de n\u00edvel superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"coordena\u00e7\u00e3o de aperfei\u00e7oamento de pessoal de n\u00edvel superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006537","name":"campus france","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006537","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10589-022-00391-x","type":"journal-article","created":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T07:02:56Z","timestamp":1657868576000},"page":"111-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Robust min-max regret covering problems"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7257-7368","authenticated-orcid":false,"given":"Amadeu A.","family":"Coco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2497-4072","authenticated-orcid":false,"given":"Andr\u00e9a Cynthia","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6831-2006","authenticated-orcid":false,"given":"Thiago F.","family":"Noronha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,15]]},"reference":[{"key":"391_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H Aissi","year":"2009","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Min-max and min-max regret versions of combinatorial optimization problems: A survey. Eur. J. Oper. Res. 197, 427\u2013438 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"391_CR2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.cor.2016.12.010","volume":"81","author":"L Assun\u00e7\u00e3o","year":"2017","unstructured":"Assun\u00e7\u00e3o, L., Santos, A.C., Noronha, T.F., Andrade, R.: A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. Comput. Oper. Res. 81, 51\u201366 (2017)","journal-title":"Comput. Oper. Res."},{"key":"391_CR3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0966-8349(98)00033-3","volume":"5","author":"I Averbakh","year":"1997","unstructured":"Averbakh, I., Berman, O.: Minmax regret p-center location on a network with demand uncertainty. Locat. Sci. 5, 247\u2013254 (1997)","journal-title":"Locat. Sci."},{"issue":"1","key":"391_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: A lagrangian heuristic for set-covering problems. Nav. Res. Logist. 37(1), 151\u2013164 (1990)","journal-title":"Nav. Res. Logist."},{"key":"391_CR5","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"391_CR6","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"391_CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0377-2217(03)00351-5","volume":"158","author":"P Beraldi","year":"2004","unstructured":"Beraldi, P., Bruni, M.E., Conforti, D.: Designing robust emergency medical service via stochastic programming. Eur. J. Oper. Res. 158, 183\u2013193 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"391_CR8","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1287\/opre.50.6.956.345","volume":"50","author":"P Beraldi","year":"2002","unstructured":"Beraldi, P., Ruszczy\u0144ski, A.: The probabilistic set-covering problem. Oper. Res. 50, 956\u2013967 (2002)","journal-title":"Oper. Res."},{"key":"391_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.ejor.2010.08.016","volume":"208","author":"O Berman","year":"2011","unstructured":"Berman, O., Wang, J.: The minmax regret gradual covering location problem on a network with incomplete information of demand weights. Eur. J. Oper. Res. 208, 233\u2013238 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"391_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"391_CR11","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47, 730\u2013743 (1999)","journal-title":"Oper. Res."},{"key":"391_CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"key":"391_CR13","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.ifacol.2016.07.649","volume":"49","author":"IA Carvalho","year":"2016","unstructured":"Carvalho, I.A., Noronha, T.F., Duhamel, C., Vieira, L.F.M.: A scenario based heuristic for the robust shortest path tree problem. IFAC-PapersOnLine 49, 443\u2013448 (2016)","journal-title":"IFAC-PapersOnLine"},{"key":"391_CR14","doi-asserted-by":"crossref","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, 101\u2013118 (1974)","journal-title":"Pap. Reg. Sci."},{"key":"391_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0006-3207(95)00102-6","volume":"76","author":"R Church","year":"1996","unstructured":"Church, R., Stoms, D.M., Davis, F.W.: Reserve selection as a maximal covering location problem. Biol. Cons. 76, 105\u2013112 (1996)","journal-title":"Biol. Cons."},{"key":"391_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10898-014-0187-x","volume":"60","author":"AA Coco","year":"2014","unstructured":"Coco, A.A., J\u00fanior, J.C.A., Noronha, T.F., Santos, A.C.: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. J. Global Optim. 60, 265\u2013287 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0187-x","journal-title":"J. Global Optim."},{"key":"391_CR17","unstructured":"Coco, A.A., Santos, A.C., Noronha, T.F.: Scenario-based heuristics with path-relinking for the robust set covering problem. In: Proceedings of MIC 2015: The XI Metaheuristics International Conference, pp. 1\u201310 (2015)"},{"key":"391_CR18","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.ifacol.2016.07.653","volume":"49","author":"AA Coco","year":"2016","unstructured":"Coco, A.A., Santos, A.C., Noronha, T.F.: Coupling scenario-based heuristics to exact methods for the robust set covering problem with interval data. IFAC-PapersOnLine 49, 455\u2013460 (2016)","journal-title":"IFAC-PapersOnLine"},{"key":"391_CR19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.endm.2018.01.016","volume":"64","author":"AA Coco","year":"2018","unstructured":"Coco, A.A., Santos, A.C., Noronha, T.F.: Formulation and algorithms for the robust maximal covering location problem. Electron. Note. Discret. Math. 64, 145\u2013154 (2018)","journal-title":"Electron. Note. Discret. Math."},{"key":"391_CR20","doi-asserted-by":"crossref","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, 882\u2013896 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"391_CR21","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"key":"391_CR22","doi-asserted-by":"crossref","unstructured":"Correia, I., da\u00a0Gama, F.S.: Facility location under uncertainty. In: Location Science, pp. 177\u2013203. Springer (2015)","DOI":"10.1007\/978-3-319-13111-5_8"},{"key":"391_CR23","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: Linear programming and extensions. Princeton University Press (1963)","DOI":"10.7249\/R366"},{"key":"391_CR24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.disopt.2010.03.008","volume":"7","author":"VG Deineko","year":"2010","unstructured":"Deineko, V.G., Woeginger, G.J.: Pinpointing the complexity of the interval min-max regret knapsack problem. Discret. Optim. 7, 191\u2013196 (2010)","journal-title":"Discret. Optim."},{"key":"391_CR25","doi-asserted-by":"crossref","unstructured":"Drezner, Z., Hamacher, H.W.: Facility location: applications and theory. Springer Science & Business Media (2001)","DOI":"10.1007\/978-3-642-56082-8"},{"key":"391_CR26","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C Duin","year":"1999","unstructured":"Duin, C., Voss, S.: The Pilot Method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34, 181\u2013191 (1999)","journal-title":"Networks"},{"key":"391_CR27","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1090\/S0002-9904-1962-10791-5","volume":"68","author":"J Edmonds","year":"1962","unstructured":"Edmonds, J.: Covers and packings in a family of sets. Bull. Am. Math. Soc. 68, 494\u2013499 (1962)","journal-title":"Bull. Am. Math. Soc."},{"key":"391_CR28","doi-asserted-by":"crossref","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., Hosseininia, M., Goh, M.: Covering problems in facility location: A review. Comput. Ind. Eng. 62, 368\u2013407 (2012)","journal-title":"Comput. Ind. Eng."},{"key":"391_CR29","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s12532-012-0039-y","volume":"4","author":"M Fischetti","year":"2012","unstructured":"Fischetti, M., Monaci, M.: Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Program. Comput. 4, 239\u2013273 (2012)","journal-title":"Math. Program. Comput."},{"key":"391_CR30","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10107-010-0365-7","volume":"124","author":"M Fischetti","year":"2010","unstructured":"Fischetti, M., Salvagnin, D., Zanette, A.: A note on the selection of Benders\u2019 cuts. Math. Program. 124, 175\u2013182 (2010)","journal-title":"Math. Program."},{"key":"391_CR31","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1287\/ijoc.2014.0632","volume":"27","author":"F Furini","year":"2015","unstructured":"Furini, F., Iori, M., Martello, S., Yagiura, M.: Heuristic and exact algorithms for the interval min-max regret knapsack problem. INFORMS J. Comput. 27, 392\u2013405 (2015)","journal-title":"INFORMS J. Comput."},{"key":"391_CR32","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1979)"},{"key":"391_CR33","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control. Cybern. 29, 653\u2013684 (2000)","journal-title":"Control. Cybern."},{"key":"391_CR34","doi-asserted-by":"crossref","unstructured":"Hammar, M., Karlsson, R., Nilsson, B.J.: Using maximum coverage to optimize recommendation systems in e-commerce. In: Proceedings of the 7th ACM Conference on Recommender Systems, RecSys \u201913, pp. 265\u2013272. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2507157.2507169"},{"key":"391_CR35","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Math. Program. 96, 33\u201360 (2003)","journal-title":"Math. Program."},{"key":"391_CR36","unstructured":"Kasperski, A., Zieli\u0144ki, P.: Minimizing maximal regret in the linear assignment problems with interval costs. Preprint 7 (2004)"},{"key":"391_CR37","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A Kasperski","year":"2006","unstructured":"Kasperski, A., Zieli\u0144ski, P.: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97, 177\u2013180 (2006)","journal-title":"Inf. Process. Lett."},{"key":"391_CR38","doi-asserted-by":"publisher","unstructured":"Kasperski, A., Zieli\u0144ski, P.: Robust discrete optimization under discrete and interval uncertainty: A survey, chap.\u00a06, pp. 113\u2013143. Springer International Publishing (2016). https:\/\/doi.org\/10.1007\/978-3-319-33121-8_6","DOI":"10.1007\/978-3-319-33121-8_6"},{"key":"391_CR39","doi-asserted-by":"crossref","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluver Academic Publishers (1997)","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"391_CR40","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2017.04.044","volume":"263","author":"P Lutter","year":"2017","unstructured":"Lutter, P., Degel, D., Busing, C., Koster, A., Werners, B.: Improved handling of uncertainty and robustness in set covering problems. Eur. J. Oper. Res. 263, 35\u201349 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"391_CR41","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.cor.2016.08.018","volume":"78","author":"VR M\u00e1ximo","year":"2017","unstructured":"M\u00e1ximo, V.R., Nascimento, M.C.V., Carvalho, A.C.P.L.F.: Intelligent-guided adaptive search for the maximum covering location problem. Comput. Oper. Res. 78, 129\u2013137 (2017)","journal-title":"Comput. Oper. Res."},{"key":"391_CR42","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1007\/s00291-017-0482-2","volume":"39","author":"S Mi\u0161kovi\u0107","year":"2017","unstructured":"Mi\u0161kovi\u0107, S.: A VNS-LP algorithm for the robust dynamic maximal covering location problem. OR Spectrum 39, 1011\u20131033 (2017)","journal-title":"OR Spectrum"},{"key":"391_CR43","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/trsc.1060.0181","volume":"41","author":"R Montemanni","year":"2007","unstructured":"Montemanni, R., Barta, J., Mastrolilli, M., Gambardella, L.M.: The robust traveling salesman problem with interval data. Transp. Sci. 41, 366\u2013381 (2007)","journal-title":"Transp. Sci."},{"key":"391_CR44","doi-asserted-by":"crossref","unstructured":"Muren, Li., H., Mukhopadhyay, S.K., Wu, J., Zhou, L., Du, Z.: Balanced maximal covering location problem and its application in bike-sharing. International Journal of Production Economics 223(4), 107513 (2020)","DOI":"10.1016\/j.ijpe.2019.09.034"},{"key":"391_CR45","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/S0377-2217(98)00186-6","volume":"111","author":"SH Owen","year":"1998","unstructured":"Owen, S.H., Daskin, M.S.: Strategic facility location: A review. Eur. J. Oper. Res. 111, 423\u2013447 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"391_CR46","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10479-011-0876-5","volume":"207","author":"J Pereira","year":"2013","unstructured":"Pereira, J., Averbakh, I.: The robust set covering problem with interval data. Ann. Oper. Res. 207, 217\u2013235 (2013). https:\/\/doi.org\/10.1007\/s10479-011-0876-5","journal-title":"Ann. Oper. Res."},{"key":"391_CR47","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.ejor.2008.12.036","volume":"200","author":"B Roy","year":"2010","unstructured":"Roy, B.: Robustness in operational research and decision aiding: A multi-faceted issue. Eur. J. Oper. Res. 200, 629\u2013638 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"391_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0224-y","volume":"121","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Goyal, V., Lejeune, M.A.: MIP reformulations of the probabilistic set covering problem. Math. Program. 121(1), 1\u201331 (2010)","journal-title":"Math. Program."},{"key":"391_CR49","first-page":"25","volume":"1","author":"DA Schilling","year":"1993","unstructured":"Schilling, D.A., Jayaraman, V., Barkhi, R.: A review of covering problem in facility location. Locat. Sci. 1, 25\u201355 (1993)","journal-title":"Locat. Sci."},{"key":"391_CR50","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/074081791009022","volume":"38","author":"LV Snyder","year":"2006","unstructured":"Snyder, L.V.: Facility location under uncertainty: A review. IIE Trans. 38, 537\u2013554 (2006)","journal-title":"IIE Trans."},{"key":"391_CR51","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10479-005-2060-2","volume":"136","author":"S Voss","year":"2005","unstructured":"Voss, S., Fink, A., Duin, C.: Looking ahead with the Pilot Method. Ann. Oper. Res. 136, 285\u2013302 (2005)","journal-title":"Ann. Oper. Res."},{"key":"391_CR52","unstructured":"Wang, S., Cui, W., Chu, F., Yu, J.: The interval min\u2013max regret knapsack packing-delivery problem. International Journal of Production Research 0, 1\u201317 (2020)"},{"key":"391_CR53","volume-title":"Integer programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer programming. Wiley-Interscience, New York, NY, USA (1998)"},{"key":"391_CR54","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1137\/17M1141576","volume":"29","author":"HH Wu","year":"2019","unstructured":"Wu, H.H., Kucukyavuz, S.: Probabilistic partial set covering with an oracle for chance constraints. SIAM J. Optim. 29, 690\u2013718 (2019)","journal-title":"SIAM J. Optim."},{"key":"391_CR55","doi-asserted-by":"publisher","unstructured":"Xia, L., Xie, M., Xu, W., Shao, J., Yin, W., Dong, J.: An empirical comparison of five efficient heuristics for maximal covering location problems. In: 2009 IEEE\/INFORMS International Conference on Service Operations, Logistics and Informatics, pp. 747\u2013753 (2009). https:\/\/doi.org\/10.1109\/SOLI.2009.5204032","DOI":"10.1109\/SOLI.2009.5204032"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00391-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00391-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00391-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:24:52Z","timestamp":1744201492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00391-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,15]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["391"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00391-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2022,7,15]]},"assertion":[{"value":"27 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2022","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}