{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:32:09Z","timestamp":1762018329244,"version":"3.37.3"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12351-020-00616-z","type":"journal-article","created":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T18:02:26Z","timestamp":1609610546000},"page":"1697-1735","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Solving combinatorial bi-level optimization problems using multiple populations and migration schemes"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9618-7206","authenticated-orcid":false,"given":"Rihab","family":"Said","sequence":"first","affiliation":[]},{"given":"Maha","family":"Elarbi","sequence":"additional","affiliation":[]},{"given":"Slim","family":"Bechikh","sequence":"additional","affiliation":[]},{"given":"Lamjed","family":"Ben Said","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"616_CR1","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1109\/TAC.1984.1103455","volume":"29","author":"E Aiyoshi","year":"1984","unstructured":"Aiyoshi E, Shimizu K (1984) A solution method for the static constrained stackelberg problem via penalty method. IEEE Trans Autom Control 29:1111\u20131114","journal-title":"IEEE Trans Autom Control"},{"key":"616_CR2","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1111\/itor.12153","volume":"22","author":"JS Angelo","year":"2015","unstructured":"Angelo JS, Barbosa HJ (2015) A study on the use of heuristics to solve a bilevel programming problem. Int Trans Oper Res 22:861\u2013882","journal-title":"Int Trans Oper Res"},{"key":"616_CR3","doi-asserted-by":"crossref","unstructured":"Angelo JS, Krempser E, Barbosa HJ (2013) Differential evolution for bilevel programming. In: IEEE congress on evolutionary computation, pp 470\u2013477","DOI":"10.1109\/CEC.2013.6557606"},{"key":"616_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.psep.2009.11.003","volume":"88","author":"KB Aviso","year":"2010","unstructured":"Aviso KB, Tan RR, Culaba AB, Cruz JB Jr (2010) Bi-level fuzzy optimization approach for water exchange in eco-industrial parks. Process Saf Environ Prot 88:31\u201340","journal-title":"Process Saf Environ Prot"},{"key":"616_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","volume":"9","author":"JF Bard","year":"1982","unstructured":"Bard JF, Falk JE (1982) An explicit solution to the multi-level programming problem. Comput Oper Res 9:77\u2013100","journal-title":"Comput Oper Res"},{"key":"616_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"JF Bard","year":"1990","unstructured":"Bard JF, Moore JT (1990) A branch and bound algorithm for the bilevel programming problem. SIAM J Sci Stat Comput 11:281\u2013292","journal-title":"SIAM J Sci Stat Comput"},{"key":"616_CR7","doi-asserted-by":"publisher","first-page":"091401","DOI":"10.1115\/1.4034035","volume":"138","author":"KS Bhattacharjee","year":"2016","unstructured":"Bhattacharjee KS, Singh HK, Ray T (2016) Multi-objective optimization with multiple spatially distributed surrogates. J Mech Des 138:091401","journal-title":"J Mech Des"},{"key":"616_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492900002518","volume":"4","author":"PT Boggs","year":"1995","unstructured":"Boggs PT, Tolle JW (1995) Sequential quadratic programming. Acta Numer 4:1\u201351","journal-title":"Acta Numer"},{"key":"616_CR9","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.cor.2010.05.007","volume":"38","author":"HI Calvete","year":"2011","unstructured":"Calvete HI, Gal\u00e9 C, Oliveros M-J (2011) Bilevel model for production-distribution planning solved by using ant colony optimization. Comput Oper Res 38:320\u2013327","journal-title":"Comput Oper Res"},{"key":"616_CR10","first-page":"827","volume":"20","author":"M-S Casas-Ram\u00edrez","year":"2017","unstructured":"Casas-Ram\u00edrez M-S, Camacho-Vallejo J-F, D\u00edaz JA, Luna DE (2017) A bi-level maximal covering location problem. Oper Res 20:827\u2013855","journal-title":"Oper Res"},{"key":"616_CR11","doi-asserted-by":"crossref","unstructured":"Chaabani A, Bechikh S, Said LB (2015) A co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. In: IEEE congress on evolutionary computation, pp 1659\u20131666","DOI":"10.1109\/CEC.2015.7257086"},{"key":"616_CR12","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.procs.2017.08.167","volume":"112","author":"A Chaabani","year":"2017","unstructured":"Chaabani A, Bechikh S, Said LB (2017) A co-evolutionary decomposition-based chemical reaction algorithm for bi-level combinatorial optimization problems. Procedia Comput Sci 112:780\u2013789","journal-title":"Procedia Comput Sci"},{"key":"616_CR13","first-page":"371","volume":"13","author":"I-M Chao","year":"1993","unstructured":"Chao I-M, Golden BL, Wasil E (1993) A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. Am J Math Manag Sci 13:371\u2013406","journal-title":"Am J Math Manag Sci"},{"key":"616_CR14","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/s12351-017-0315-8","volume":"17","author":"C-B Cheng","year":"2017","unstructured":"Cheng C-B, Shih H-S, Chen B (2017) Subsidy rate decisions for the printer recycling industry by bi-level optimization techniques. Oper Res Int J 17:901\u2013919","journal-title":"Oper Res Int J"},{"key":"616_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides N, Eilon S (1969) An algorithm for the vehicle-dispatching problem. J Oper Res Soc 20:309\u2013318","journal-title":"J Oper Res Soc"},{"key":"616_CR16","volume-title":"Statistical power analysis for the behavioral sciences","author":"J Cohen","year":"1977","unstructured":"Cohen J (1977) Statistical power analysis for the behavioral sciences, vol 490. Academic Press, Boca Raton"},{"key":"616_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10589-005-4612-4","volume":"30","author":"B Colson","year":"2005","unstructured":"Colson B, Marcotte P, Savard G (2005) A trust-region method for nonlinear bilevel programming: algorithm and computational experience. Comput Optim Appl 30:211\u2013227","journal-title":"Comput Optim Appl"},{"key":"616_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J-F Cordeau","year":"1997","unstructured":"Cordeau J-F, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30:105\u2013119","journal-title":"Networks"},{"key":"616_CR19","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8:631\u2013657","journal-title":"SIAM J Optim"},{"key":"616_CR20","first-page":"30","volume":"26","author":"K Deb","year":"1996","unstructured":"Deb K, Goyal M (1996) A combined genetic adaptive search (geneas) for engineering design. Comput Sci Inform 26:30\u201345","journal-title":"Comput Sci Inform"},{"key":"616_CR21","doi-asserted-by":"crossref","unstructured":"Deb K, Sinha A (2014) Evolutionary bilevel optimization (EBO). In: Proceedings of the companion publication of the annual conference on genetic and evolutionary computation, pp 857\u2013876","DOI":"10.1145\/2598394.2605362"},{"key":"616_CR22","doi-asserted-by":"crossref","unstructured":"Dempe S, Kalashnikov VV, Kalashnykova N (2006) Optimality conditions for bilevel programming problems. In: Optimization with multivalued mappings. Springer, pp 3\u201328","DOI":"10.1007\/0-387-34221-4_1"},{"key":"616_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3\u201318","journal-title":"Swarm Evol Comput"},{"key":"616_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.swevo.2011.02.001","volume":"1","author":"AE Eiben","year":"2011","unstructured":"Eiben AE, Smit SK (2011) Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm Evol Comput 1:19\u201331","journal-title":"Swarm Evol Comput"},{"key":"616_CR25","first-page":"4253","volume":"6","author":"C-M Feng","year":"2005","unstructured":"Feng C-M, Wen C-C (2005) A fuzzy bi-level and multi-objective model to control traffic flow into the disaster area post earthquake. J East Asia Soc Transp Stud 6:4253\u20134268","journal-title":"J East Asia Soc Transp Stud"},{"key":"616_CR26","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10957-006-9136-2","volume":"131","author":"J Fliege","year":"2006","unstructured":"Fliege J, Vicente LN (2006) Multicriteria approach to bilevel optimization. J Optim Theory Appl 131:209\u2013225","journal-title":"J Optim Theory Appl"},{"key":"616_CR27","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF00121266","volume":"8","author":"M Gendreau","year":"1996","unstructured":"Gendreau M, Marcotte P, Savard G (1996) A hybrid tabu-ascent algorithm for the linear bilevel programming problem. J Global Optim 8:217\u2013233","journal-title":"J Global Optim"},{"key":"616_CR28","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","volume":"4","author":"BE Gillett","year":"1976","unstructured":"Gillett BE, Johnson JG (1976) Multi-terminal vehicle-dispatch algorithm. Omega 4:711\u2013718","journal-title":"Omega"},{"key":"616_CR29","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P Hansen","year":"1992","unstructured":"Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13:1194\u20131217","journal-title":"SIAM J Sci Stat Comput"},{"key":"616_CR30","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1016\/S0305-0548(01)00066-1","volume":"29","author":"SR Hejazi","year":"2002","unstructured":"Hejazi SR, Memariani A, Jahanshahloo G, Sepehri MM (2002) Linear bilevel programming solution by genetic algorithm. Comput Oper Res 29:1913\u20131925","journal-title":"Comput Oper Res"},{"key":"616_CR31","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1109\/TEVC.2020.2987804","volume":"24","author":"P-Q Huang","year":"2020","unstructured":"Huang P-Q, Wang Y (2020) A framework for scalable bilevel optimization: Identifying and utilizing the interactions between upper-level and lower-level variables. IEEE Trans Evol Comput 24:1150\u20131163","journal-title":"IEEE Trans Evol Comput"},{"key":"616_CR32","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TEVC.2017.2670659","volume":"21","author":"MM Islam","year":"2017","unstructured":"Islam MM, Singh HK, Ray T (2017a) A surrogate assisted approach for single-objective bilevel optimization. IEEE Trans Evol Comput 21:681\u2013696","journal-title":"IEEE Trans Evol Comput"},{"key":"616_CR33","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1162\/evco_a_00198","volume":"25","author":"MM Islam","year":"2017","unstructured":"Islam MM, Singh HK, Ray T, Sinha A (2017b) An enhanced memetic algorithm for single-objective bilevel optimization problems. Evol Comput 25:607\u2013642","journal-title":"Evol Comput"},{"key":"616_CR34","doi-asserted-by":"crossref","unstructured":"Mor\u00e9 JJ (1983) Recent developments in algorithms and software for trust region methods. In: Mathematical programming the state of the art, pp 258\u2013287","DOI":"10.1007\/978-3-642-68874-4_11"},{"key":"616_CR35","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow RG (1985) The polynomial hierarchy and a simple model for competitive analysis. Math Program 32:146\u2013164","journal-title":"Math Program"},{"key":"616_CR36","doi-asserted-by":"crossref","first-page":"4332","DOI":"10.1016\/j.amc.2012.10.010","volume":"219","author":"Y Jiang","year":"2013","unstructured":"Jiang Y, Li X, Huang C, Wu X (2013) Application of particle swarm optimization based on CHKS smoothing function for solving nonlinear bilevel programming problem. Appl Math Comput 219:4332\u20134339","journal-title":"Appl Math Comput"},{"key":"616_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1022647728419","volume":"98","author":"C Kirjner-Neto","year":"1998","unstructured":"Kirjner-Neto C, Polak E, Der Kiureghian A (1998) An outer approximations approach to reliability-based optimal design of structures. J Optim Theory Appl 98:1\u201316","journal-title":"J Optim Theory Appl"},{"key":"616_CR38","doi-asserted-by":"crossref","unstructured":"Koh A (2007) Solving transportation bi-level programs with differential evolution. In: IEEE congress on evolutionary computation, pp 2243\u20132250","DOI":"10.1109\/CEC.2007.4424750"},{"key":"616_CR39","doi-asserted-by":"crossref","unstructured":"K\u00fc\u00e7\u00fckayd\u0131n H, Aras N, Alt\u0131nel \u0130K (2010) A hybrid tabu search heuristic for a bilevel competitive facility location model. In: International workshop on hybrid metaheuristics. Springer, pp 31\u201345","DOI":"10.1007\/978-3-642-16054-7_3"},{"key":"616_CR40","doi-asserted-by":"crossref","unstructured":"Legillon F, Liefooghe A, Talbi E-G (2012) Cobra: a cooperative coevolutionary algorithm for bi-level optimization. In: IEEE congress on evolutionary computation, pp 1\u20138","DOI":"10.1109\/CEC.2012.6256620"},{"key":"616_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro\/1994280100011","volume":"28","author":"R Mathieu","year":"1994","unstructured":"Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithm based approach to bi-level linear programming. RAIRO-Oper Res 28:1\u201321","journal-title":"RAIRO-Oper Res"},{"key":"616_CR42","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0191-2615(00)00016-3","volume":"35","author":"Q Meng","year":"2001","unstructured":"Meng Q, Yang H, Bell MG (2001) An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transp Res B Methodol 35:83\u2013105","journal-title":"Transp Res B Methodol"},{"key":"616_CR43","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01099649","volume":"7","author":"A Migdalas","year":"1995","unstructured":"Migdalas A (1995) Bilevel programming in traffic planning: models, methods and challenge. J Global Optim 7:381\u2013405","journal-title":"J Global Optim"},{"key":"616_CR44","doi-asserted-by":"crossref","unstructured":"Oduguwa V, Roy R (2002) Bi-level optimisation using genetic algorithm. In: null. IEEE, p 322","DOI":"10.1109\/ICAIS.2002.1048121"},{"key":"616_CR45","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"J-Y Potvin","year":"1996","unstructured":"Potvin J-Y, Bengio S (1996) The vehicle routing problem with time windows part ii: genetic search. INFORMS J Comput 8:165\u2013172","journal-title":"INFORMS J Comput"},{"key":"616_CR46","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0098-1354(98)00267-1","volume":"23","author":"KH Sahin","year":"1998","unstructured":"Sahin KH, Ciric AR (1998) A dual temperature simulated annealing approach for solving bilevel programming problems. Comput Chem Eng 23:11\u201325","journal-title":"Comput Chem Eng"},{"key":"616_CR47","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s12351-010-0090-2","volume":"12","author":"M Sakawa","year":"2012","unstructured":"Sakawa M, Katagiri H, Matsui T (2012) Stackelberg solutions for fuzzy random bilevel linear programming through level sets and probability maximization. Oper Res Int J 12:271\u2013286","journal-title":"Oper Res Int J"},{"key":"616_CR48","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/B:NETS.0000027771.13826.3a","volume":"4","author":"S Shepherd","year":"2004","unstructured":"Shepherd S, Sumalee A (2004) A genetic algorithm based approach to optimal toll level and location problems. Netw Spatial Econ 4:161\u2013179","journal-title":"Netw Spatial Econ"},{"key":"616_CR49","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10732-019-09426-9","volume":"26","author":"A Sinha","year":"2020","unstructured":"Sinha A, Lu Z, Deb K, Malo P (2020) Bilevel optimization based on iterative approximation of multiple mappings. J Heurist 26:151\u2013185","journal-title":"J Heurist"},{"key":"616_CR50","doi-asserted-by":"crossref","unstructured":"Sinha A, Malo P, Deb K (2013a) Evolutionary bilevel optimization. In: Proceedings of the 15th annual conference companion on genetic and evolutionary computation, pp 877\u2013892","DOI":"10.1145\/2464576.2480812"},{"key":"616_CR51","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2016.08.027","volume":"257","author":"A Sinha","year":"2017","unstructured":"Sinha A, Malo P, Deb K (2017a) Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping. Eur J Oper Res 257:395\u2013411","journal-title":"Eur J Oper Res"},{"key":"616_CR52","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TEVC.2017.2712906","volume":"22","author":"A Sinha","year":"2017","unstructured":"Sinha A, Malo P, Deb K (2017b) A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans Evol Comput 22:276\u2013295","journal-title":"IEEE Trans Evol Comput"},{"key":"616_CR53","doi-asserted-by":"crossref","unstructured":"Sinha A, Malo P, Frantsev A, Deb K (2013b) Multi-objective stackelberg game between a regulating authority and a mining company: a case study in environmental economics. In: IEEE congress on evolutionary computation, pp 478\u2013485","DOI":"10.1109\/CEC.2013.6557607"},{"key":"616_CR54","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1007\/s00500-014-1283-z","volume":"19","author":"C Sun","year":"2015","unstructured":"Sun C, Jin Y, Zeng J, Yu Y (2015) A two-layer surrogate-assisted particle swarm optimization algorithm. Soft Comput 19:1461\u20131475","journal-title":"Soft Comput"},{"key":"616_CR55","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.apm.2007.02.007","volume":"32","author":"H Sun","year":"2008","unstructured":"Sun H, Gao Z, Wu J (2008) A bi-level programming model and solution algorithm for the location of logistics distribution centers. Appl Math Model 32:610\u2013616","journal-title":"Appl Math Model"},{"key":"616_CR56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37838-6","volume-title":"Metaheuristics for bi-level optimization","author":"E-G Talbi","year":"2013","unstructured":"Talbi E-G (2013) Metaheuristics for bi-level optimization, vol 482. Springer, Berlin"},{"key":"616_CR57","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01096412","volume":"3","author":"DJ White","year":"1993","unstructured":"White DJ, Anandalingam G (1993) A penalty function approach for solving bi-level linear programs. J Global Optim 3:397\u2013419","journal-title":"J Global Optim"},{"key":"616_CR58","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1090\/S0273-0979-04-01040-7","volume":"42","author":"M Wright","year":"2005","unstructured":"Wright M (2005) The interior-point revolution in optimization: history, recent developments, and lasting consequences. Bull Am Math Soc 42:39\u201356","journal-title":"Bull Am Math Soc"},{"key":"616_CR59","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) Moea\/d: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11:712\u2013731","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00616-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00616-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00616-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T07:55:25Z","timestamp":1670658925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00616-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["616"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00616-z","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"23 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}