{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T08:45:59Z","timestamp":1777193159504,"version":"3.51.4"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"S4","license":[{"start":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T00:00:00Z","timestamp":1626652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T00:00:00Z","timestamp":1626652800000},"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":["Engineering with Computers"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00366-021-01470-z","type":"journal-article","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T04:03:03Z","timestamp":1626667383000},"page":"3423-3444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["An enhanced binary slime mould algorithm for solving the 0\u20131 knapsack problem"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3618-6620","authenticated-orcid":false,"given":"Benyamin","family":"Abdollahzadeh","sequence":"first","affiliation":[]},{"given":"Saeid","family":"Barshandeh","sequence":"additional","affiliation":[]},{"given":"Hatef","family":"Javadi","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Epicoco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,19]]},"reference":[{"issue":"3","key":"1470_CR1","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.ejor.2015.10.014","volume":"250","author":"RP Rooderkerk","year":"2016","unstructured":"Rooderkerk RP, van Heerde HJ (2016) Robust optimization of the 0\u20131 knapsack problem: balancing risk and return in assortment optimization. Eur J Oper Res 250(3):842\u2013854","journal-title":"Eur J Oper Res"},{"key":"1470_CR2","doi-asserted-by":"crossref","unstructured":"Oppong E, Oppong S, Asamoah D, Abiew NA (2019) Meta-heuristics approach to knapsack problem in memory management.\u00a0Asian J Res Comput Sci 3(2):1\u201310","DOI":"10.9734\/ajrcos\/2019\/v3i230087"},{"issue":"3","key":"1470_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1111\/mice.12246","volume":"32","author":"F Taillandier","year":"2017","unstructured":"Taillandier F, Fernandez C, Ndiaye A (2017) Real estate property maintenance optimization based on multiobjective multidimensional knapsack problem. Comput Aided Civ Infrastruct Eng 32(3):227\u2013251","journal-title":"Comput Aided Civ Infrastruct Eng"},{"key":"1470_CR4","doi-asserted-by":"crossref","unstructured":"M\u00fcller S, Al-Shatri H, Wichtlhuber M, Hausheer D, Klein, A (2015) Computation offloading in wireless multi-hop networks: Energy minimization via multi-dimensional knapsack problem. In: 2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). IEEE, pp 1717\u20131722","DOI":"10.1109\/PIMRC.2015.7343576"},{"issue":"7","key":"1470_CR5","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1007\/s11590-017-1209-7","volume":"12","author":"T Karaboghossian","year":"2018","unstructured":"Karaboghossian T, Zito M (2018) Easy knapsacks and the complexity of energy allocation problems in the smart grid. Optim Lett 12(7):1553\u20131568","journal-title":"Optim Lett"},{"issue":"11","key":"1470_CR6","doi-asserted-by":"publisher","first-page":"7174","DOI":"10.1007\/s11227-019-02933-3","volume":"75","author":"M Masdari","year":"2019","unstructured":"Masdari M, Barshande S, Ozdemir S (2019) CDABC: chaotic discrete artificial bee colony algorithm for multi-level clustering in large-scale WSNs. J Supercomput 75(11):7174\u20137208","journal-title":"J Supercomput"},{"issue":"11","key":"1470_CR7","doi-asserted-by":"publisher","first-page":"5459","DOI":"10.1007\/s12652-020-01902-6","volume":"11","author":"M Masdari","year":"2020","unstructured":"Masdari M, Barshandeh S (2020) Discrete teaching\u2014learning-based optimization algorithm for clustering in wireless sensor networks. J Ambient Intell Humaniz Comput 11(11):5459\u20135476","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"1","key":"1470_CR8","first-page":"157","volume":"2","author":"S Khan","year":"2002","unstructured":"Khan S et al (2002) Solving the knapsack problem for adaptive multimedia systems. Stud Inform Univ 2(1):157\u2013178","journal-title":"Stud Inform Univ"},{"issue":"1\u20132","key":"1470_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10479-013-1312-9","volume":"241","author":"P Jacko","year":"2016","unstructured":"Jacko P (2016) Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic. Ann Oper Res 241(1\u20132):83\u2013107","journal-title":"Ann Oper Res"},{"key":"1470_CR10","unstructured":"Cho M (2019) The knapsack problem and its applications to the cargo loading problem.\u00a0Anal Appl Math 48"},{"issue":"2","key":"1470_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2018.07.013","volume":"275","author":"F Brandt","year":"2019","unstructured":"Brandt F, Nickel S (2019) The air cargo load planning problem-a consolidated problem definition and literature review on related problems. Eur J Oper Res 275(2):399\u2013410","journal-title":"Eur J Oper Res"},{"key":"1470_CR12","doi-asserted-by":"publisher","first-page":"59388","DOI":"10.1109\/ACCESS.2019.2913678","volume":"7","author":"J Liu","year":"2019","unstructured":"Liu J, Bi J, Xu S (2019) An improved attack on the basic Merkle-Hellman Knapsack cryptosystem. IEEE Access 7:59388\u201359393","journal-title":"IEEE Access"},{"key":"1470_CR13","doi-asserted-by":"crossref","unstructured":"Tripathi D, Shukla AK, Reddy R, Bopche GS (2020) Multi-layer hybrid credit scoring model based on feature selection, ensemble learning, and ensemble classifier. In: Handbook of research on emerging trends and applications of machine learning. IGI Global pp 444\u2013460","DOI":"10.4018\/978-1-5225-9643-1.ch021"},{"key":"1470_CR14","unstructured":"Abdollahzadeh B, Gharehchopogh FS (2021) A multi-objective optimization algorithm for feature selection problems.\u00a0Eng Comput 1\u201319"},{"issue":"11","key":"1470_CR15","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1057\/jors.1980.188","volume":"31","author":"G Laporte","year":"1980","unstructured":"Laporte G, Nobert Y (1980) A cutting planes algorithm for the m-salesmen problem. J Oper Res Soc 31(11):1017\u20131023","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1470_CR16","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":"1","key":"1470_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M Padberg","year":"1987","unstructured":"Padberg M, Rinaldi G (1987) Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper Res Lett 6(1):1\u20137","journal-title":"Oper Res Lett"},{"issue":"3","key":"1470_CR18","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C et al (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46(3):316\u2013329","journal-title":"Oper Res"},{"issue":"4","key":"1470_CR19","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res 14(4):699\u2013719","journal-title":"Oper Res"},{"key":"1470_CR20","doi-asserted-by":"crossref","unstructured":"Dhiman G (2019) ESA: a hybrid bio-inspired metaheuristic optimization approach for engineering problems.\u00a0Eng Comput 37(1):323\u2013353","DOI":"10.1007\/s00366-019-00826-w"},{"key":"1470_CR21","doi-asserted-by":"crossref","unstructured":"Shukla AK, Pippal SK, Chauhan SS (2019) An empirical evaluation of teaching\u2013learning-based optimization, genetic algorithm and particle swarm optimization.\u00a0Int J Comput Appl 1\u201315","DOI":"10.1080\/1206212X.2019.1686562"},{"key":"1470_CR22","doi-asserted-by":"crossref","unstructured":"Barshandeh S, Haghzadeh M (2020) A new hybrid chaotic atom search optimization based on tree-seed algorithm and Levy flight for solving optimization problems.\u00a0Eng Comput 1\u201344","DOI":"10.1007\/s00366-020-00994-0"},{"key":"1470_CR23","doi-asserted-by":"publisher","first-page":"106560","DOI":"10.1016\/j.knosys.2020.106560","volume":"211","author":"G Dhiman","year":"2021","unstructured":"Dhiman G et al (2021) BEPO: a novel binary emperor penguin optimizer for automatic feature selection. Knowl Based Syst 211:106560","journal-title":"Knowl Based Syst"},{"key":"1470_CR24","doi-asserted-by":"crossref","unstructured":"Shukla AK (2020) Detection of anomaly intrusion utilizing self-adaptive grasshopper optimization algorithm.\u00a0Neural Comput Appl 33(13):7541\u20137561","DOI":"10.1007\/s00521-020-05500-7"},{"key":"1470_CR25","doi-asserted-by":"crossref","unstructured":"Barshandeh S, Piri F, Sangani SR (2020) HMPA: an innovative hybrid multi-population algorithm based on artificial ecosystem-based and Harris Hawks optimization algorithms for engineering problems.\u00a0Eng Comput 1\u201345","DOI":"10.1007\/s00366-020-01120-w"},{"key":"1470_CR26","doi-asserted-by":"crossref","unstructured":"Shukla AK, Singh P, Vardhan M (2018) An empirical study on multi-objective swarm algorithm for standard multi-objective benchmark problems. In: Proceedings of 3rd international conference on internet of things and connected technologies (ICIoTCT), pp 26\u201327","DOI":"10.2139\/ssrn.3170526"},{"key":"1470_CR27","doi-asserted-by":"crossref","unstructured":"Benyamin A, Farhad SG, Saeid, B (2021) Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems.\u00a0Int J Intell Syst 36(3):1270\u20131303","DOI":"10.1002\/int.22342"},{"key":"1470_CR28","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1142\/9789813270237_0002","volume":"84","author":"AK Shukla","year":"2018","unstructured":"Shukla AK, Singh P, Vardhan M (2018) Hybrid TLBO-GSA strategy for constrained and unconstrained engineering optimization functions. Hybrid Metaheuristics Res Appl 84:41","journal-title":"Hybrid Metaheuristics Res Appl"},{"key":"1470_CR29","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.advengsoft.2017.05.014","volume":"114","author":"G Dhiman","year":"2017","unstructured":"Dhiman G, Kumar V (2017) Spotted hyena optimizer: a novel bio-inspired based metaheuristic technique for engineering applications. Adv Eng Softw 114:48\u201370","journal-title":"Adv Eng Softw"},{"key":"1470_CR30","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.knosys.2018.06.001","volume":"159","author":"G Dhiman","year":"2018","unstructured":"Dhiman G, Kumar V (2018) Emperor penguin optimizer: a bio-inspired algorithm for engineering problems. Knowl Based Syst 159:20\u201350","journal-title":"Knowl Based Syst"},{"key":"1470_CR31","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.knosys.2018.11.024","volume":"165","author":"G Dhiman","year":"2019","unstructured":"Dhiman G, Kumar V (2019) Seagull optimization algorithm: theory and its applications for large-scale industrial engineering problems. Knowl Based Syst 165:169\u2013196","journal-title":"Knowl Based Syst"},{"key":"1470_CR32","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.engappai.2019.03.021","volume":"82","author":"G Dhiman","year":"2019","unstructured":"Dhiman G, Kaur A (2019) STOA: a bio-inspired based optimization algorithm for industrial engineering problems. Eng Appl Artif Intell 82:148\u2013174","journal-title":"Eng Appl Artif Intell"},{"key":"1470_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103541","volume":"90","author":"S Kaur","year":"2020","unstructured":"Kaur S et al (2020) Tunicate Swarm Algorithm: a new bio-inspired based metaheuristic paradigm for global optimization. Eng Appl Artif Intell 90:103541","journal-title":"Eng Appl Artif Intell"},{"key":"1470_CR34","doi-asserted-by":"publisher","first-page":"5306","DOI":"10.35940\/ijitee.A4215.119119","volume":"9","author":"M Dehghani","year":"2019","unstructured":"Dehghani M et al (2019) BOSA: binary orientation search algorithm. Int J Innov Technol Explor Eng 9:5306\u20135310","journal-title":"Int J Innov Technol Explor Eng"},{"key":"1470_CR35","doi-asserted-by":"crossref","unstructured":"Dhiman G, Garg M, Nagar A, Kumar V, Dehghani M (2020) A novel algorithm for global optimization: rat swarm optimizer.\u00a0J Ambient Intell Human Comput 1\u201326","DOI":"10.1007\/s12652-020-02580-0"},{"key":"1470_CR36","first-page":"286","volume":"13","author":"M Dehghani","year":"2020","unstructured":"Dehghani M et al (2020) Darts game optimizer: a new optimization technique based on darts game. Int J Intell Eng Syst 13:286\u2013294","journal-title":"Int J Intell Eng Syst"},{"issue":"18","key":"1470_CR37","doi-asserted-by":"publisher","first-page":"6173","DOI":"10.3390\/app10186173","volume":"10","author":"M Dehghani","year":"2020","unstructured":"Dehghani M et al (2020) A spring search algorithm applied to engineering optimization problems. Appl Sci 10(18):6173","journal-title":"Appl Sci"},{"key":"1470_CR38","doi-asserted-by":"crossref","unstructured":"Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: A new method for stochastic optimization.\u00a0Future Gener Comput Syst 111:300\u2013323","DOI":"10.1016\/j.future.2020.03.055"},{"issue":"9","key":"1470_CR39","doi-asserted-by":"publisher","first-page":"5477","DOI":"10.1007\/s00521-018-3375-7","volume":"31","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset M, El-Shahat D, El-Henawy I (2019) Solving 0\u20131 knapsack problem by binary flower pollination algorithm. Neural Comput Appl 31(9):5477\u20135495","journal-title":"Neural Comput Appl"},{"issue":"3\u20134","key":"1470_CR40","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s11721-011-0063-y","volume":"5","author":"K Li","year":"2011","unstructured":"Li K et al (2011) Slime mold inspired routing protocols for wireless sensor networks. Swarm Intell 5(3\u20134):183\u2013223","journal-title":"Swarm Intell"},{"key":"1470_CR41","doi-asserted-by":"crossref","unstructured":"Zhao J, Gao ZM, Sun W (2020) The improved slime mould algorithm with Levy flight. In: Journal of physics: conference series, vol 1617, issue 1. IOP Publishing, p 012033","DOI":"10.1088\/1742-6596\/1617\/1\/012033"},{"key":"1470_CR42","doi-asserted-by":"crossref","unstructured":"Zhao, J., & Gao, Z. M. (2020). The hybridized Harris hawk optimization and slime mould algorithm. In: Journal of physics: conference series, vol 1682, issue 1. IOP Publishing, p 012029","DOI":"10.1088\/1742-6596\/1682\/1\/012029"},{"key":"1470_CR43","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0\u20131 knapsack problem. Appl Soft Comput 38:817\u2013830","journal-title":"Appl Soft Comput"},{"key":"1470_CR44","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.asoc.2014.02.010","volume":"19","author":"KK Bhattacharjee","year":"2014","unstructured":"Bhattacharjee KK, Sarmah SP (2014) Shuffled frog leaping algorithm and its application to 0\/1 knapsack problem. Appl Soft Comput 19:252\u2013263","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1470_CR45","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s12293-016-0211-4","volume":"10","author":"Y Feng","year":"2018","unstructured":"Feng Y et al (2018) Solving 0\u20131 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation. Memet Comput 10(2):135\u2013150","journal-title":"Memet Comput"},{"issue":"7","key":"1470_CR46","doi-asserted-by":"publisher","first-page":"2781","DOI":"10.1007\/s00500-015-1681-x","volume":"20","author":"D Zouache","year":"2016","unstructured":"Zouache D, Nouioua F, Moussaoui A (2016) Quantum-inspired firefly algorithm with particle swarm optimization for discrete optimization problems. Soft Comput 20(7):2781\u20132799","journal-title":"Soft Comput"},{"key":"1470_CR47","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ins.2014.12.016","volume":"299","author":"Z Beheshti","year":"2015","unstructured":"Beheshti Z, Shamsuddin SM, Hasan S (2015) Memetic binary particle swarm optimization for discrete optimization problems. Inf Sci 299:58\u201384","journal-title":"Inf Sci"},{"key":"1470_CR48","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.procs.2015.08.158","volume":"60","author":"W Nakbi","year":"2015","unstructured":"Nakbi W, Alaya I, Zouari W (2015) A hybrid lagrangian search ant colony optimization algorithm for the multidimensional knapsack problem. Proc Comput Sci 60:1109\u20131119","journal-title":"Proc Comput Sci"},{"key":"1470_CR49","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-44254-9_5","volume-title":"Cohort intelligence: a socio-inspired optimization method","author":"AJ Kulkarni","year":"2017","unstructured":"Kulkarni AJ, Krishnasamy G, Abraham A (2017) Solution to 0\u20131 knapsack problem using cohort intelligence algorithm. Cohort intelligence: a socio-inspired optimization method. Springer, pp 55\u201374"},{"key":"1470_CR50","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari AA et al (2019) Harris hawks optimization: algorithm and applications. Future Gener Comput Syst 97:849\u2013872","journal-title":"Future Gener Comput Syst"},{"key":"1470_CR51","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","journal-title":"Adv Eng Softw"},{"key":"1470_CR52","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.asoc.2018.07.033","volume":"71","author":"H Shayanfar","year":"2018","unstructured":"Shayanfar H, Gharehchopogh FS (2018) Farmland fertility: a new metaheuristic algorithm for solving continuous optimization problems. Appl Soft Comput 71:728\u2013746","journal-title":"Appl Soft Comput"},{"key":"1470_CR53","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN'95-international conference on neural networks,\u00a0vol 4. IEEE, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"3","key":"1470_CR54","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao RV, Savsani VJ, Vakharia D (2011) Teaching\u2013learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303\u2013315","journal-title":"Comput Aided Des"},{"issue":"3","key":"1470_CR55","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s10489-020-01893-z","volume":"51","author":"FA Hashim","year":"2021","unstructured":"Hashim FA et al (2021) Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems. Appl Intell 51(3):1531\u20131551","journal-title":"Appl Intell"},{"key":"1470_CR56","doi-asserted-by":"publisher","first-page":"43979","DOI":"10.1109\/ACCESS.2019.2908489","volume":"7","author":"AE Ezugwu","year":"2019","unstructured":"Ezugwu AE et al (2019) A comparative study of meta-heuristic optimization algorithms for 0\u20131 knapsack problem: some initial results. IEEE Access 7:43979\u201344001","journal-title":"IEEE Access"}],"container-title":["Engineering with Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-021-01470-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00366-021-01470-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-021-01470-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T06:03:30Z","timestamp":1668751410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00366-021-01470-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,19]]},"references-count":56,"journal-issue":{"issue":"S4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1470"],"URL":"https:\/\/doi.org\/10.1007\/s00366-021-01470-z","relation":{},"ISSN":["0177-0667","1435-5663"],"issn-type":[{"value":"0177-0667","type":"print"},{"value":"1435-5663","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,19]]},"assertion":[{"value":"18 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}