{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:26Z","timestamp":1740123506182,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["41701452"],"award-info":[{"award-number":["41701452"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"The Natural Science Foundation of Guangdong","doi-asserted-by":"crossref","award":["2019A1515011501"],"award-info":[{"award-number":["2019A1515011501"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Research and Development Program of China","award":["2017YFB0504203"],"award-info":[{"award-number":["2017YFB0504203"]}]},{"name":"Strategic Priority Research Program of the Chinese Academy of Sciences","award":["XDA19030301"],"award-info":[{"award-number":["XDA19030301"]}]},{"name":"Open Funding of the State Key Laboratory of Earthquake Dynamics","award":["LED2016B03"],"award-info":[{"award-number":["LED2016B03"]}]},{"name":"Shenzhen Scientific Research and Development Funding Program","award":["JCYJ20170302144002028"],"award-info":[{"award-number":["JCYJ20170302144002028"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s11227-020-03227-9","type":"journal-article","created":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T19:02:46Z","timestamp":1583348566000},"page":"9800-9826","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-granularity hybrid parallel network simplex algorithm for minimum-cost flow problems"],"prefix":"10.1007","volume":"76","author":[{"given":"Jincheng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinsong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chisheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,4]]},"reference":[{"key":"3227_CR1","doi-asserted-by":"crossref","unstructured":"Rao L, Liu X, Xie L, Liu W (2010) Minimizing electricity cost: optimization of distributed internet data centers in a multi-electricity-market environment. In: INFOCOM, 2010 Proceedings IEEE. IEEE, pp 1\u20139","DOI":"10.1109\/INFCOM.2010.5461933"},{"key":"3227_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.12.009","author":"S Zhao","year":"2018","unstructured":"Zhao S, Sun X, Chen J, Duan Z, Zhang Y, Zhang Y (2018) Relational granulation method based on quotient space theory for maximum flow problem. Inf Sci. https:\/\/doi.org\/10.1016\/j.ins.2018.12.009","journal-title":"Inf Sci"},{"key":"3227_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ins.2013.11.029","volume":"265","author":"S Han","year":"2014","unstructured":"Han S, Peng Z, Wang S (2014) The maximum flow problem of uncertain network. Inf Sci 265:167\u2013175","journal-title":"Inf Sci"},{"issue":"2","key":"3227_CR4","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/TNET.2011.2161487","volume":"20","author":"L Chiaraviglio","year":"2012","unstructured":"Chiaraviglio L, Mellia M, Neri F (2012) Minimizing ISP network energy cost: formulation and solutions. IEEE\/ACM Trans Netw 20(2):463\u2013476","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"3227_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.ejor.2010.11.015","volume":"211","author":"RJI Basten","year":"2011","unstructured":"Basten RJI, Van der Heijden MC, Schutten JMJ (2011) Practical extensions to a minimum cost flow model for level of repair analysis. Eur J Oper Res 211(2):333\u2013342","journal-title":"Eur J Oper Res"},{"key":"3227_CR6","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.jclepro.2013.08.042","volume":"85","author":"M Jin","year":"2014","unstructured":"Jin M, Granda-Marulanda NA, Down I (2014) The impact of carbon policies on supply chain design and logistics of a major retailer. J Clean Prod 85:453\u2013461","journal-title":"J Clean Prod"},{"issue":"7","key":"3227_CR7","first-page":"165","volume":"7","author":"F Xie","year":"2012","unstructured":"Xie F, Jia Y, Jia R (2012) Algorithm for minimum cost maximum flow in transportation network. J Converg Inf Technol 7(7):165\u2013173","journal-title":"J Converg Inf Technol"},{"key":"3227_CR8","volume-title":"Network flows: theory, algorithms and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice-Hall, Englewood Cliffs"},{"issue":"2","key":"3227_CR9","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19(2):248\u2013264","journal-title":"J ACM"},{"issue":"4","key":"3227_CR10","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"AV Goldberg","year":"1989","unstructured":"Goldberg AV, Tarjan RE (1989) Finding minimum-cost circulations by canceling negative cycles. J ACM 36(4):873\u2013886","journal-title":"J ACM"},{"key":"3227_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/1097-0037(200008)36:1<53::AID-NET6>3.0.CO;2-Y","volume":"36","author":"PT Sokkalingam","year":"2000","unstructured":"Sokkalingam PT, Ahuja RK, Orlin JB (2000) New polynomial time cycle-canceling algorithms for minimum-cost flows. Networks 36:53\u201363","journal-title":"Networks"},{"key":"3227_CR12","doi-asserted-by":"crossref","unstructured":"Goldberg A, Tarjan R (1987) Solving minimum cost flow problem by successive approximation. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing. ACM, pp 7\u201318","DOI":"10.1145\/28395.28397"},{"issue":"2","key":"3227_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02614365","volume":"78","author":"JB Orlin","year":"1997","unstructured":"Orlin JB (1997) A polynomial time primal network simplex algorithm for minimum cost flows. Math Program 78(2):109\u2013129","journal-title":"Math Program"},{"issue":"1\u20133","key":"3227_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01580869","volume":"47","author":"D Goldfarb","year":"1990","unstructured":"Goldfarb D, Hao JX (1990) A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time. Math Program 47(1\u20133):353\u2013365","journal-title":"Math Program"},{"issue":"3","key":"3227_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF02703378","volume":"31","author":"L Ciupala","year":"2006","unstructured":"Ciupala L (2006) A deficit scaling algorithm for the minimum flow problem. Sadhana 31(3):227\u2013233","journal-title":"Sadhana"},{"key":"3227_CR16","unstructured":"Holzhauser M, Krumke SO, Thielen C (2016) On the complexity and approximability of budget-constrained minimum cost flows. arXiv preprint arXiv:1607.02282"},{"issue":"2","key":"3227_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02614366","volume":"78","author":"RD Armstrong","year":"1997","unstructured":"Armstrong RD, Jin ZY (1997) A new strongly polynomial dual network simplex algorithm. Math Program 78(2):131\u2013148","journal-title":"Math Program"},{"issue":"3","key":"3227_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10288-008-0087-3","volume":"7","author":"A Eusebio","year":"2009","unstructured":"Eusebio A, Figueira JR, Ehrgott M (2009) A primal-dual simplex algorithm for bi-objective network flow problems. 4OR 7(3):255\u2013273","journal-title":"4OR"},{"issue":"4","key":"3227_CR19","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1016\/j.cor.2006.07.009","volume":"35","author":"C Caliskan","year":"2008","unstructured":"Caliskan C (2008) A double scaling algorithm for the constrained maximum flow problem. Comput Oper Res 35(4):1138\u20131150","journal-title":"Comput Oper Res"},{"issue":"3","key":"3227_CR20","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/j.ejor.2016.11.024","volume":"259","author":"M Holzhauser","year":"2017","unstructured":"Holzhauser M, Krumke SO, Thielen C (2017) A network simplex method for the budget-constrained minimum cost flow problem. Eur J Oper Res 259(3):864\u2013872","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3227_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.ejor.2010.10.018","volume":"210","author":"C \u00c7al\u0131\u015fkan","year":"2011","unstructured":"\u00c7al\u0131\u015fkan C (2011) A specialized network simplex algorithm for the constrained maximum flow problem. Eur J Oper Res 210(2):137\u2013147","journal-title":"Eur J Oper Res"},{"issue":"7","key":"3227_CR22","doi-asserted-by":"publisher","first-page":"2574","DOI":"10.1016\/j.jpdc.2014.02.005","volume":"74","author":"WM Hwu","year":"2014","unstructured":"Hwu WM (2014) What is ahead for parallel computing. J Parallel Distrib Comput 74(7):2574\u20132581","journal-title":"J Parallel Distrib Comput"},{"key":"3227_CR23","doi-asserted-by":"crossref","unstructured":"Sato M (2002) OpenMP: parallel programming API for shared memory multiprocessors and on-chip multiprocessors. In: Proceedings of the 15th International Symposium on System Synthesis. ACM, pp 109\u2013111","DOI":"10.1109\/ISSS.2002.1227161"},{"key":"3227_CR24","doi-asserted-by":"crossref","unstructured":"Kirk D (2007) NVIDIA CUDA software and GPU parallel computing architecture. In: ISMM, vol 7, pp 103\u2013104","DOI":"10.1145\/1296907.1296909"},{"key":"3227_CR25","doi-asserted-by":"crossref","unstructured":"Buck I (2007) GPU computing: programming a massively parallel processor. In: 2007. CGO\u201907. International Symposium on Code Generation and Optimization. IEEE, p 17","DOI":"10.1109\/CGO.2007.13"},{"key":"3227_CR26","doi-asserted-by":"crossref","unstructured":"Tziritas N, Khan SU, Xu CZ, Hong J (2012) An optimal fully distributed algorithm to minimize the resource consumption of cloud applications. In: 2012 IEEE 18th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, pp 61\u201368","DOI":"10.1109\/ICPADS.2012.19"},{"issue":"12","key":"3227_CR27","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.jpdc.2013.07.020","volume":"73","author":"N Tziritas","year":"2013","unstructured":"Tziritas N, Khan SU, Xu CZ, Loukopoulos T, Lalis S (2013) On minimizing the resource consumption of cloud applications using process migrations. J Parallel Distrib Comput 73(12):1690\u20131704","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"3227_CR28","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01299544","volume":"2","author":"DP Bertsekas","year":"1993","unstructured":"Bertsekas DP, Castanon DA (1993) Parallel primal\u2013dual methods for the minimum cost flow problem. Comput Optim Appl 2(4):317\u2013336","journal-title":"Comput Optim Appl"},{"issue":"8","key":"3227_CR29","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1016\/S0167-8191(97)00003-3","volume":"23","author":"P Beraldi","year":"1997","unstructured":"Beraldi P, Guerriero F (1997) A parallel asynchronous implementation of the \u03b5-relaxation method for the linear minimum cost flow problem. Parallel Comput 23(8):1021\u20131044","journal-title":"Parallel Comput"},{"issue":"3","key":"3227_CR30","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1023\/A:1022613603828","volume":"95","author":"P Beraldi","year":"1997","unstructured":"Beraldi P, Guerriero F, Musmanno R (1997) Efficient parallel algorithms for the minimum cost flow problem. J Optim Theory Appl 95(3):501\u2013530","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"3227_CR31","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1008778622003","volume":"18","author":"P Beraldi","year":"2001","unstructured":"Beraldi P, Guerriero F, Musmanno R (2001) Parallel algorithms for solving the convex minimum cost flow problem. Comput Optim Appl 18(2):175\u2013190","journal-title":"Comput Optim Appl"},{"key":"3227_CR32","first-page":"21","volume-title":"Algorithms. SIGAL 1990. Lecture Notes in Computer Scienc","author":"H Imai","year":"1990","unstructured":"Imai H, Iwano K (1990) Efficient sequential and parallel algorithms for planar minimum cost flow. In: Asano T, Ibaraki T, Imai H, Nishizeki T (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg, pp 21\u201330","edition":"450"},{"issue":"14","key":"3227_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0167-6377(93)90068-R","volume":"4","author":"JB Orlin","year":"1993","unstructured":"Orlin JB, Stein C (1993) Parallel algorithms for the assignment and minimum-cost flow problems. Oper Res Lett 4(14):181\u2013186","journal-title":"Oper Res Lett"},{"key":"3227_CR34","unstructured":"Andrzej L, Mia P (2012) A fast parallel algorithm for minimum-cost small integral flows. In: Euro-Par 2012 Parallel Processing. Springer, Berlin, pp 688\u2013699"},{"issue":"2","key":"3227_CR35","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s00453-013-9865-1","volume":"72","author":"A Lingas","year":"2015","unstructured":"Lingas A, Persson M (2015) A fast parallel algorithm for minimum-cost small integral flows. Algorithmica 72(2):607\u2013619","journal-title":"Algorithmica"},{"issue":"3","key":"3227_CR36","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s11227-008-0253-6","volume":"49","author":"G Yarmish","year":"2009","unstructured":"Yarmish G, Slyke R (2009) A distributed, scaleable simplex method. J Supercomput 49(3):373\u2013381","journal-title":"J Supercomput"},{"key":"3227_CR37","doi-asserted-by":"crossref","unstructured":"Ploskas N, Samaras N, Margaritis K (2013) A parallel implementation of the revised simplex algorithm using OpenMP: some preliminary results. In: Optimization Theory, Decision Making, and Operational Research Applications, Springer Proceedings in Mathematics and Statistics, vol 31, pp 163\u2013175","DOI":"10.1007\/978-1-4614-5134-1_11"},{"key":"3227_CR38","doi-asserted-by":"crossref","unstructured":"Lalami ME, Boyer V, El-Baz D (2011) Efficient implementation of the simplex method on a CPU\u2013GPU system. In: Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, Washington DC, 16\u201320 May 2011, pp 1999\u20132006","DOI":"10.1109\/IPDPS.2011.362"},{"key":"3227_CR39","doi-asserted-by":"crossref","unstructured":"Bieling J, Peschlow P, Martini P (2010) An efficient GPU implementation of the revised simplex method. In: Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium, 19\u201323 April 2010, Atlanta, pp 1\u20138","DOI":"10.1109\/IPDPSW.2010.5470831"},{"key":"3227_CR40","unstructured":"Meyer X, Albuquerque P, Chopard B (2011) A MultiGPU implementation and performance model for the standard simplex method. In: Proceedings of the 1st International Symposium and 10th Balkan Conference on Operational Research, 22\u201325 September 2011, Thessaloniki, pp 312\u2013319"},{"issue":"4","key":"3227_CR41","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s10100-016-0452-9","volume":"25","author":"P Tar","year":"2017","unstructured":"Tar P, St\u00e1gel B, Maros I (2017) Parallel search paths for the simplex algorithm. CEJOR 25(4):967\u2013984","journal-title":"CEJOR"},{"key":"3227_CR42","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1018957107705","volume":"81","author":"JAJ Hall","year":"1998","unstructured":"Hall JAJ, McKinnon KIM (1998) ASYNPLEX, an asynchronous parallel revised simplex algorithms. Ann Oper Res 81:27\u201350","journal-title":"Ann Oper Res"},{"issue":"2","key":"3227_CR43","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0167-6377(00)00017-1","volume":"27","author":"D Klabjan","year":"2000","unstructured":"Klabjan D, Johnson EL, Nemhauser GL (2000) A parallel primal\u2013dual simplex algorithm. Oper Res Lett 27(2):47\u201355","journal-title":"Oper Res Lett"},{"issue":"3","key":"3227_CR44","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10589-013-9542-y","volume":"55","author":"M Lubin","year":"2013","unstructured":"Lubin M, Hall JAJ, Petra CG, Anitescu M (2013) Parallel distributed-memory simplex for large-scale stochastic LP problems. Comput Optim Appl 55(3):571\u2013596","journal-title":"Comput Optim Appl"},{"key":"3227_CR45","doi-asserted-by":"crossref","unstructured":"Thulasiraman K, Chalasani RP, Comeau MA (1993) Parallel network dual simplex method on a shared memory multiprocessor. In: Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993. IEEE, pp 408\u2013415","DOI":"10.1109\/SPDP.1993.395504"},{"key":"3227_CR46","doi-asserted-by":"crossref","unstructured":"Mamalis B, Perlitis M (2016) A hybrid parallelization scheme for standard simplex method based on CPU\/GPU collaboration. In: Proceedings of the 20th Pan-Hellenic Conference on Informatics, pp 1\u20136","DOI":"10.1145\/3003733.3003757"},{"issue":"1","key":"3227_CR47","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","volume":"10","author":"Q Huangfu","year":"2018","unstructured":"Huangfu Q, Hall JJ (2018) Parallelizing the dual revised simplex method. Math Program Comput 10(1):119\u2013142","journal-title":"Math Program Comput"},{"key":"3227_CR48","doi-asserted-by":"crossref","unstructured":"Zhong Z, Feng M, Liu D (2015) Parallelization of revised simplex algorithm on GPUs. In: 2015 International Conference on Network and Information Systems for Computers. IEEE, pp 349\u2013353","DOI":"10.1109\/ICNISC.2015.108"},{"issue":"22","key":"3227_CR49","doi-asserted-by":"publisher","first-page":"30035","DOI":"10.1007\/s11042-018-5947-z","volume":"77","author":"L He","year":"2018","unstructured":"He L, Bai H, Jiang Y, Ouyang D, Jiang S (2018) Revised simplex algorithm for linear programming on GPUs with CUDA. Multimed Tools Appl 77(22):30035\u201330050","journal-title":"Multimed Tools Appl"},{"issue":"4","key":"3227_CR50","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg AV, Tarjan RE (1988) A new approach to the maximum flow problem. J ACM 35(4):921\u2013940","journal-title":"J ACM"},{"issue":"2","key":"3227_CR51","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel D, Tarjan RE (1984) Fast algorithms for finding nearest common ancestors. SIAM J Comput 13(2):338\u2013355","journal-title":"SIAM J Comput"},{"key":"3227_CR52","unstructured":"Eppstein D (1994) Clustering for faster network simplex pivots. In: SODA, pp 160\u2013166"},{"issue":"3","key":"3227_CR53","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/ijoc.8.3.318","volume":"8","author":"RK Ahuja","year":"1996","unstructured":"Ahuja RK, Orlin JB (1996) Use of representative operation counts in computational testing of algorithms. Informs J Comput 8(3):318\u2013330","journal-title":"Informs J Comput"},{"issue":"3","key":"3227_CR54","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0167-6377(02)00114-1","volume":"30","author":"RK Ahuja","year":"2002","unstructured":"Ahuja RK, Orlin JB, Sharma P, Sokkalingam PT (2002) A network simplex algorithm with O(n) consecutive degenerate pivots. Oper Res Lett 30(3):141\u2013148","journal-title":"Oper Res Lett"},{"key":"3227_CR55","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH et al (2001) Introduction to algorithms. MIT Press, Cambridge"},{"key":"3227_CR56","unstructured":"Kelly DJ, ONeill GM (1991) The minimum cost flow problem and the network simplex solution method. Doctoral dissertation, University College Dublin, Graduate School of Business"},{"key":"3227_CR57","volume-title":"Network flows and matching: first DIMACS implementation challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"T Badics","year":"1993","unstructured":"Badics T, Boros E, Cepek O (1993) Implementing a new maximum flow algorithm. In: Johnson DS, McGeoch CC (eds) Network flows and matching: first DIMACS implementation challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 12. American Mathematical Society, Providence"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03227-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-020-03227-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03227-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T00:28:48Z","timestamp":1614817728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-020-03227-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,4]]},"references-count":57,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["3227"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03227-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2020,3,4]]},"assertion":[{"value":"4 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}