{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T15:55:59Z","timestamp":1778082959531,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T00:00:00Z","timestamp":1655942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T00:00:00Z","timestamp":1655942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00521-022-07438-4","type":"journal-article","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T06:02:55Z","timestamp":1655964175000},"page":"611-626","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["An investigation of IBM quantum computing device performance on combinatorial optimisation problems"],"prefix":"10.1007","volume":"37","author":[{"given":"Maxine T.","family":"Khumalo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hazel A.","family":"Chieza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4821-8151","authenticated-orcid":false,"given":"Krupa","family":"Prag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Woolway","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,23]]},"reference":[{"key":"7438_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.energy.2019.04.186","volume":"179","author":"A Ajagekar","year":"2019","unstructured":"Ajagekar A, You F (2019) Quantum computing for energy systems optimization: challenges and opportunities. Energy 179:76\u201389","journal-title":"Energy"},{"key":"7438_CR2","unstructured":"Asfaw A, Bello L, Ben-Haim Y, Bravyi S, Capelluto L, Vazquez AC, Ceroni J, Harkins F, Gambetta J, Garion S, Gil L, Gonzalez SDLP, McKay D, Minev Z, Nation P, Phan A, Rattew A, Schaefer J, Shabani J, Smolin J, Temme K, Tod M, Wootton J (2020) Learn quantum computation using qiskit. http:\/\/community.qiskit.org\/textbook"},{"issue":"5","key":"7438_CR3","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett CH, Bernstein E, Brassard G, Vazirani U (1997) Strengths and weaknesses of quantum computing. SIAM J Comput 26(5):1510\u20131523","journal-title":"SIAM J Comput"},{"issue":"5","key":"7438_CR4","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein E, Vazirani U (1997) Quantum complexity theory. SIAM J Comput 26(5):1411\u20131473","journal-title":"SIAM J Comput"},{"issue":"3","key":"7438_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0167-6377(89)90037-0","volume":"8","author":"RG Bland","year":"1989","unstructured":"Bland RG, Shallcross DF (1989) Large travelling salesman problems arising from experiments in x-ray crystallography: a preliminary report on computation. Oper Res Lett 8(3):125\u2013128. https:\/\/doi.org\/10.1016\/0167-6377(89)90037-0","journal-title":"Oper Res Lett"},{"issue":"4","key":"7438_CR6","first-page":"B121","volume":"21","author":"RE Burkard","year":"1977","unstructured":"Burkard RE, Offermann J (1977) Entwurf von schreibmaschinentastaturen mittels quadratischer zuordnungsprobleme. Z f\u00fcr Oper Res 21(4):B121\u2013B132","journal-title":"Z f\u00fcr Oper Res"},{"key":"7438_CR7","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1007\/978-1-4613-0303-9_27","volume-title":"Handbook of combinatorial optimization","author":"RE Burkard","year":"1998","unstructured":"Burkard RE, Cela E, Pardalos PM, Pitsoulis LS (1998) The quadratic assignment problem. Handbook of combinatorial optimization. Springer, Boston, pp 1713\u20131809"},{"issue":"3","key":"7438_CR8","doi-asserted-by":"publisher","first-page":"031001","DOI":"10.1115\/1.4006656","volume":"4","author":"Y Chen","year":"2012","unstructured":"Chen Y, Feng J, Wu Y (2012) Novel form-finding of tensegrity structures using ant colony systems. J Mech Robot 4(3):031001. https:\/\/doi.org\/10.1115\/1.4006656","journal-title":"J Mech Robot"},{"key":"7438_CR9","doi-asserted-by":"publisher","first-page":"106328","DOI":"10.1016\/j.compstruc.2020.106328","volume":"239","author":"Y Chen","year":"2020","unstructured":"Chen Y, Fan L, Bai Y, Feng J, Sareh P (2020) Assigning mountain-valley fold lines of flat-foldable origami patterns based on graph theory and mixed-integer linear programming. Comput Struct 239:106328","journal-title":"Comput Struct"},{"key":"7438_CR10","doi-asserted-by":"crossref","unstructured":"Chen Y, Yan J, Feng J, Sareh P (2021) Particle swarm optimization-based metaheuristic design generation of non-trivial flat-foldable origami tessellations with degree-4 vertices. J Mech Des 143(1)","DOI":"10.1115\/1.4047437"},{"key":"7438_CR11","doi-asserted-by":"publisher","unstructured":"Chieza H, Khumalo M, Prag K, Woolway M (2020) On the computational performance of ibm quantum devices applied to combinatorial optimisation problems. In: 2020 7th international conference on soft computing & machine intelligence (ISCMI), IEEE, pp 260\u2013264, https:\/\/doi.org\/10.1109\/ISCMI51676.2020.9311605","DOI":"10.1109\/ISCMI51676.2020.9311605"},{"key":"7438_CR12","unstructured":"Clausen J (1999) Branch and bound algorithms-principles and examples. Department of Computer Science, University of Copenhagen pp 1\u201330"},{"key":"7438_CR13","unstructured":"Crooks GE (2018) Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419"},{"issue":"1","key":"7438_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391","journal-title":"Manag Sci"},{"issue":"1","key":"7438_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/opre.7.1.58","volume":"7","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Fulkerson DR, Johnson SM (1959) On a linear-programming, combinatorial approach to the traveling-salesman problem. Oper Res 7(1):58\u201366","journal-title":"Oper Res"},{"key":"7438_CR16","doi-asserted-by":"crossref","unstructured":"Deutsch D (1985) Quantum theory, the church-turing principle and the universal quantum computer. Proceedings of the Rryal society of london a mathematical and physical sciences 400(1818):97\u2013117","DOI":"10.1098\/rspa.1985.0070"},{"issue":"1","key":"7438_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0041-1647(72)90111-6","volume":"6","author":"J Dickey","year":"1972","unstructured":"Dickey J, Hopkins J (1972) Campus building arrangement using topaz. Transp Res 6(1):59\u201368","journal-title":"Transp Res"},{"issue":"4","key":"7438_CR18","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"issue":"1","key":"7438_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/jors.1977.29","volume":"28","author":"AN Elshafei","year":"1977","unstructured":"Elshafei AN (1977) Hospital layout as a quadratic assignment problem. J Oper Res Soc 28(1):167\u2013179","journal-title":"J Oper Res Soc"},{"key":"7438_CR20","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028"},{"key":"7438_CR21","unstructured":"Farhi E, Goldstone J, Gutmann S, Neven H (2017) Quantum algorithms for fixed qubit architectures. arXiv preprint arXiv:1703.06199"},{"key":"7438_CR22","unstructured":"Farhi E, Gamarnik D, Gutmann S (2020) The quantum approximate optimization algorithm needs to see the whole graph: a typical case. arXiv preprint arXiv:2004.09002"},{"key":"7438_CR23","unstructured":"Ferreira C (2001) Gene expression programming: a new adaptive algorithm for solving problems. arXiv preprint cs\/0102027"},{"issue":"2","key":"7438_CR24","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1287\/opre.14.2.210","volume":"14","author":"JW Gavett","year":"1966","unstructured":"Gavett JW, Plyter NV (1966) The optimal assignment of facilities to locations by branch and bound. Oper Res 14(2):210\u2013232","journal-title":"Oper Res"},{"key":"7438_CR25","doi-asserted-by":"publisher","first-page":"214","DOI":"10.22331\/q-2019-12-09-214","volume":"3","author":"E Grant","year":"2019","unstructured":"Grant E, Wossnig L, Ostaszewski M, Benedetti M (2019) An initialization strategy for addressing barren plateaus in parametrized quantum circuits. Quantum 3:214","journal-title":"Quantum"},{"issue":"2","key":"7438_CR26","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover LK (1997) Quantum mechanics helps in searching for a needle in a haystack. Phys Rev Lett 79(2):325","journal-title":"Phys Rev Lett"},{"key":"7438_CR27","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1038\/s41567-020-01105-y","volume":"17","author":"MP Harrigan","year":"2021","unstructured":"Harrigan MP, Sung KJ, Neeley M, Satzinger KJ, Arute F, Arya K, Atalaya J, Bardin JC, Barends R, Boixo S et al (2021) Quantum approximate optimization of non-planar graph problems on a planar superconducting processor. Nat Phys 17:332","journal-title":"Nat Phys"},{"issue":"1","key":"7438_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"WK Hastings","year":"1970","unstructured":"Hastings WK (1970) Monte carlo sampling methods using markov chains and their applications. Biometrika 57(1):97\u2013109","journal-title":"Biometrika"},{"issue":"4598","key":"7438_CR29","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"1","key":"7438_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 25(1):53\u201376","journal-title":"Econometrica"},{"key":"7438_CR31","first-page":"557","volume-title":"The traveling salesman problem","author":"B Korte","year":"2012","unstructured":"Korte B, Vygen J (2012) The Traveling Salesman Problem. Springer, Berlin, pp 557\u2013592"},{"key":"7438_CR32","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-68279-0_5","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"AH Land","year":"2010","unstructured":"Land AH, Doig AG (2010) An automatic method for solving discrete programming problems. 50 Years of Integer Programming 1958\u20132008. Springer, Berlin, pp 105\u2013132"},{"issue":"2","key":"7438_CR33","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):231\u2013247","journal-title":"Eur J Oper Res"},{"issue":"4","key":"7438_CR34","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"EL Lawler","year":"1963","unstructured":"Lawler EL (1963) The quadratic assignment problem. Manag Sci 9(4):586\u2013599","journal-title":"Manag Sci"},{"issue":"4","key":"7438_CR35","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1057\/jors.1975.151","volume":"26","author":"JK Lenstra","year":"1975","unstructured":"Lenstra JK, Kan AR (1975) Some simple applications of the travelling salesman problem. J Oper Res Soc 26(4):717\u2013733","journal-title":"J Oper Res Soc"},{"issue":"2","key":"7438_CR36","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"7438_CR37","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas A (2014) Ising formulations of many np problems. Front Phys 2:5","journal-title":"Front Phys"},{"issue":"1","key":"7438_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-018-07090-4","volume":"9","author":"JR McClean","year":"2018","unstructured":"McClean JR, Boixo S, Smelyanskiy VN, Babbush R, Neven H (2018) Barren plateaus in quantum neural network training landscapes. Nat Commun 9(1):1\u20136","journal-title":"Nat Commun"},{"issue":"6","key":"7438_CR39","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087\u20131092","journal-title":"J Chem Phys"},{"issue":"3","key":"7438_CR40","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aab822","volume":"3","author":"N Moll","year":"2018","unstructured":"Moll N, Barkoutsos P, Bishop LS, Chow JM, Cross A, Egger DJ, Filipp S, Fuhrer A, Gambetta JM, Ganzhorn M et al (2018) Quantum optimization using variational algorithms on near-term quantum devices. Quantum Sci Technol 3(3):030503","journal-title":"Quantum Sci Technol"},{"issue":"1","key":"7438_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/npjqi.2015.23","volume":"2","author":"A Montanaro","year":"2016","unstructured":"Montanaro A (2016) Quantum algorithms: an overview. npj Quantum Inf 2(1):1\u20138","journal-title":"npj Quantum Inf"},{"key":"7438_CR42","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison DR, Jacobson SH, Sauppe JJ, Sewell EC (2016) Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. Discret Optim 19:79\u2013102. https:\/\/doi.org\/10.1016\/j.disopt.2016.01.005","journal-title":"Discret Optim"},{"key":"7438_CR43","doi-asserted-by":"crossref","unstructured":"Murali P, Baker JM, Javadi-Abhari A, Chong FT, Martonosi M (2019) Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers. In: Proceedings of the twenty-fourth international conference on architectural support for programming languages and operating systems, pp 1015\u20131029","DOI":"10.1145\/3297858.3304075"},{"key":"7438_CR44","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo A, McClean J, Shadbolt P, Yung MH, Zhou XQ, Love PJ, Aspuru-Guzik A, O\u2019brien JL (2014) A variational eigenvalue solver on a photonic quantum processor. Nat Commun 5:4213","journal-title":"Nat Commun"},{"key":"7438_CR45","unstructured":"Rattew AG, Hu S, Pistoia M, Chen R, Wood SP (2019) A domain-agnostic, noise-resistant, hardware-efficient evolutionary variational quantum eigensolver. arXiv: Quantum Physics"},{"issue":"6195","key":"7438_CR46","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1126\/science.1252319","volume":"345","author":"TF R\u00f8nnow","year":"2014","unstructured":"R\u00f8nnow TF, Wang Z, Job J, Boixo S, Isakov SV, Wecker D, Martinis JM, Lidar DA, Troyer M (2014) Defining and detecting quantum speedup. Science 345(6195):420\u2013424","journal-title":"Science"},{"issue":"3","key":"7438_CR47","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23(3):555\u2013565","journal-title":"J ACM"},{"key":"7438_CR48","unstructured":"Srinivasan K, Satyajit S, Behera BK, Panigrahi PK (2018) Efficient quantum algorithm for solving travelling salesman problem: an ibm quantum experience. arXiv preprint arXiv:1805.10928"},{"issue":"3","key":"7438_CR49","doi-asserted-by":"publisher","first-page":"034008","DOI":"10.1088\/2058-9565\/ab8c2b","volume":"5","author":"M Streif","year":"2020","unstructured":"Streif M, Leib M (2020) Training the quantum approximate optimization algorithm without access to a quantum processing unit. Quantum Sci Technol 5(3):034008","journal-title":"Quantum Sci Technol"},{"key":"7438_CR50","unstructured":"Stutzle T (1997) Max-min ant system for quadratic assignment problems. Germany: Intellektik Group, Department of Computer Science, Darmstadt University of Technology (Report No AIDA-97-04)"},{"issue":"4\u20135","key":"7438_CR51","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9 Taillard","year":"1991","unstructured":"Taillard \u00c9 (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4\u20135):443\u2013455","journal-title":"Parallel Comput"},{"key":"7438_CR52","doi-asserted-by":"crossref","unstructured":"Van\u00a0Laarhoven PJ, Aarts EH (1987) Simulated annealing. In: Simulated annealing: theory and applications, Springer, pp 7\u201315","DOI":"10.1007\/978-94-015-7744-1_2"},{"issue":"12","key":"7438_CR53","doi-asserted-by":"publisher","first-page":"124114","DOI":"10.1063\/1.5141458","volume":"152","author":"V Verteletskyi","year":"2020","unstructured":"Verteletskyi V, Yen TC, Izmaylov AF (2020) Measurement optimization in the variational quantum eigensolver using a minimum clique cover. J Chem Phys 152(12):124114","journal-title":"J Chem Phys"},{"key":"7438_CR54","unstructured":"Warren RH (2017) Small traveling salesman problems. J Adv Appl Math 2(2)"},{"issue":"1","key":"7438_CR55","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/07408178708975376","volume":"19","author":"MR Wilhelm","year":"1987","unstructured":"Wilhelm MR, Ward TL (1987) Solving quadratic assignment problems by \u2018simulated annealing\u2019. IIE Trans 19(1):107\u2013119","journal-title":"IIE Trans"},{"key":"7438_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-020-02692-8","volume":"19","author":"M Willsch","year":"2020","unstructured":"Willsch M, Willsch D, Jin F, De Raedt H, Michielsen K (2020) Benchmarking the quantum approximate optimization algorithm. Quantum Inf Process 19:1\u201324","journal-title":"Quantum Inf Process"},{"key":"7438_CR57","unstructured":"Zahedinejad E, Zaribafiyan A (2017) Combinatorial optimization on gate model quantum computers: a survey. arXiv preprint arXiv:1708.05294"},{"issue":"1","key":"7438_CR58","doi-asserted-by":"publisher","first-page":"7","DOI":"10.3390\/info10010007","volume":"10","author":"AH Zhou","year":"2019","unstructured":"Zhou AH, Zhu LP, Hu B, Deng S, Song Y, Qiu H, Pan S (2019) Traveling-salesman-problem algorithm based on simulated annealing and gene-expression programming. Information 10(1):7","journal-title":"Information"},{"issue":"2","key":"7438_CR59","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou L, Wang ST, Choi S, Pichler H, Lukin MD (2020) Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Phys Rev X 10(2):021067","journal-title":"Phys Rev X"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07438-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07438-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07438-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T18:27:56Z","timestamp":1737656876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07438-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,23]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["7438"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07438-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,23]]},"assertion":[{"value":"7 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 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"}}]}}