{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:37:18Z","timestamp":1768343838001,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:00:00Z","timestamp":1604966400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:00:00Z","timestamp":1604966400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s40314-020-01349-7","type":"journal-article","created":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T17:17:19Z","timestamp":1605028639000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds"],"prefix":"10.1007","volume":"39","author":[{"given":"Alireza","family":"Amini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6757-926X","authenticated-orcid":false,"given":"Reza","family":"Tavakkoli-Moghaddam","sequence":"additional","affiliation":[]},{"given":"Sadoullah","family":"Ebrahimnejad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,10]]},"reference":[{"issue":"3","key":"1349_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1108\/JHLSCM-11-2018-0072","volume":"10","author":"H Adarang","year":"2020","unstructured":"Adarang H, Bozorgi-Amiri A, Khalili-Damghani K, Tavakkoli-Moghaddam R (2020) A robust bi-objective location-routing model for providing emergency medical services. J Humanit Logist Supply Chain Manag 10(3):285\u2013319. https:\/\/doi.org\/10.1108\/JHLSCM-11-2018-0072","journal-title":"J Humanit Logist Supply Chain Manag"},{"key":"1349_CR2","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1287\/trsc.2014.0581","volume":"50","author":"Y Adulyasak","year":"2016","unstructured":"Adulyasak Y, Jaillet P (2016) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transp Sci 50:608\u2013626. https:\/\/doi.org\/10.1287\/trsc.2014.0581","journal-title":"Transp Sci"},{"key":"1349_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-020-00591-5","author":"G Ahmadi","year":"2020","unstructured":"Ahmadi G, Tavakkoli-Moghaddam R, Baboli A, Najafi M (2020) A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study. Oper Res Int J. https:\/\/doi.org\/10.1007\/s12351-020-00591-5 ((ArticleinPress))","journal-title":"Oper Res Int J"},{"key":"1349_CR4","doi-asserted-by":"publisher","unstructured":"Amini A, Tavakkoli-Moghaddam R, Ebrahimnejad S (2018) Scenario-based location arc routing problems: introducing mathematical models. In: Xu J, Gen M, Hajiyev A, Cooke F (eds) Proceedings of the eleventh international conference on management science and engineering management (ICMSEM). Springer, Cham, Japan, pp. 511\u2013521. https:\/\/doi.org\/10.1007\/978-3-319-59280-0_41","DOI":"10.1007\/978-3-319-59280-0_41"},{"key":"1349_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/19427867.2019.1679405","volume":"00","author":"A Amini","year":"2019","unstructured":"Amini A, Tavakkoli-Moghaddam R, Ebrahimnejad S (2019) A bi-objective transportation-location arc routing problem. Transp Lett 00:1\u201315. https:\/\/doi.org\/10.1080\/19427867.2019.1679405","journal-title":"Transp Lett"},{"key":"1349_CR6","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tre.2019.05.014","volume":"128","author":"M Amiri","year":"2019","unstructured":"Amiri M, Amin SH, Tavakkoli-Moghaddam R (2019a) A Lagrangean decomposition approach for a novel two-echelon node-based location-routing problem in an offshore oil and gas supply chain. Transp Res Part E Logist Transp Rev 128:96\u2013114. https:\/\/doi.org\/10.1016\/j.tre.2019.05.014","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"1349_CR7","doi-asserted-by":"publisher","first-page":"522","DOI":"10.24200\/sci.2018.20412","volume":"26","author":"M Amiri","year":"2019","unstructured":"Amiri M, Sadjadi SJ, Tavakkoli-Moghaddam R, Jabbarzadeh A (2019b) Optimal fleet composition and mix periodic location-routing problem with time windows in an offshore oil and gas industry: a case study of National Iranian Oil Company. Sci Iran 26:522\u2013537. https:\/\/doi.org\/10.24200\/sci.2018.20412","journal-title":"Sci Iran"},{"key":"1349_CR8","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton"},{"key":"1349_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52:35\u201353. https:\/\/doi.org\/10.1287\/opre.1030.0065","journal-title":"Oper Res"},{"key":"1349_CR10","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.eswa.2017.01.038","volume":"77","author":"S Braaten","year":"2017","unstructured":"Braaten S, Gj\u00f8nnes O, Hvattum LM, Tirado G (2017) Heuristics for the robust vehicle routing problem with time windows. Expert Syst Appl 77:136\u2013147. https:\/\/doi.org\/10.1016\/j.eswa.2017.01.038","journal-title":"Expert Syst Appl"},{"key":"1349_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","volume":"258","author":"EK Burke","year":"2017","unstructured":"Burke EK, Bykov Y (2017) The late acceptance hill-climbing heuristic. Eur J Oper Res 258:70\u201378. https:\/\/doi.org\/10.1016\/j.ejor.2016.07.012","journal-title":"Eur J Oper Res"},{"key":"1349_CR12","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/S0305-0548(00)00009-5","volume":"28","author":"Y Chan","year":"2001","unstructured":"Chan Y, Carter WB, Burnes MD (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput Oper Res 28:803\u2013826. https:\/\/doi.org\/10.1016\/S0305-0548(00)00009-5","journal-title":"Comput Oper Res"},{"key":"1349_CR13","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1007\/s40314-015-0302-8","volume":"36","author":"S Emami","year":"2017","unstructured":"Emami S, Moslehi G, Sabbagh M (2017) A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach. Comput Appl Math 36:1471\u20131515. https:\/\/doi.org\/10.1007\/s40314-015-0302-8","journal-title":"Comput Appl Math"},{"key":"1349_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jclepro.2018.07.258","volume":"200","author":"AM Fathollahi-Fard","year":"2018","unstructured":"Fathollahi-Fard AM, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2018) A bi-objective green home health care routing problem. J Clean Prod 200:423\u2013443. https:\/\/doi.org\/10.1016\/j.jclepro.2018.07.258","journal-title":"J Clean Prod"},{"key":"1349_CR15","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.knosys.2012.09.007","volume":"37","author":"MH Fazel Zarandi","year":"2013","unstructured":"Fazel Zarandi MH, Hemmati A, Davari S, Burhan Turksen I (2013) Capacitated location-routing problem with time windows under uncertainty. Knowl Based Syst 37:480\u2013489. https:\/\/doi.org\/10.1016\/j.knosys.2012.09.007","journal-title":"Knowl Based Syst"},{"key":"1349_CR16","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1287\/trsc.2018.0881","volume":"53","author":"E Fern\u00e1ndez","year":"2019","unstructured":"Fern\u00e1ndez E, Laporte G, Rodr\u00edguez-pereira J (2019) Exact solution of several families of location-arc routing problems. Transp Sci 53:1313\u20131333. https:\/\/doi.org\/10.1287\/trsc.2018.0881","journal-title":"Transp Sci"},{"key":"1349_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF03399222","volume":"38","author":"G Ghiani","year":"2001","unstructured":"Ghiani G, Laporte G (2001) Location-arc routing problems. Opserach 38:151\u2013159. https:\/\/doi.org\/10.1007\/BF03399222","journal-title":"Opserach"},{"key":"1349_CR18","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1:190\u2013206. https:\/\/doi.org\/10.1287\/ijoc.1.3.190","journal-title":"ORSA J Comput"},{"key":"1349_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.2016.0678","volume":"51","author":"A Goel","year":"2016","unstructured":"Goel A, Irnich S (2016) An exact method for vehicle routing and truck driver scheduling problems. Transp Sci 51:1\u201318. https:\/\/doi.org\/10.1287\/trsc.2016.0678","journal-title":"Transp Sci"},{"key":"1349_CR20","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1287\/opre.1120.1136","volume":"61","author":"CE Gounaris","year":"2013","unstructured":"Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper Res 61:677\u2013693. https:\/\/doi.org\/10.1287\/opre.1120.1136","journal-title":"Oper Res"},{"key":"1349_CR21","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s40314-014-0179-y","volume":"35","author":"F Habibzadeh Boukani","year":"2016","unstructured":"Habibzadeh Boukani F, Farhang Moghaddam B, Pishvaee MS (2016) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 35:45\u201360. https:\/\/doi.org\/10.1007\/s40314-014-0179-y","journal-title":"Comput Appl Math"},{"key":"1349_CR22","doi-asserted-by":"publisher","first-page":"106832","DOI":"10.1016\/j.cie.2020.106832","volume":"149","author":"A Hasani Goodarzi","year":"2020","unstructured":"Hasani Goodarzi A, Tavakkoli-Moghaddam R, Amini A (2020) A new bi-objective vehicle routing-scheduling problem with cross-docking: mathematical model and algorithms. Comput Ind Eng 149:106832. https:\/\/doi.org\/10.1016\/j.cie.2020.106832","journal-title":"Comput Ind Eng"},{"key":"1349_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.ejor.2012.06.015","volume":"224","author":"SH Hashemi Doulabi","year":"2013","unstructured":"Hashemi Doulabi SH, Seifi A (2013) Lower and upper bounds for location-arc routing problems with vehicle capacity constraints. Eur J Oper Res 224:189\u2013208. https:\/\/doi.org\/10.1016\/j.ejor.2012.06.015","journal-title":"Eur J Oper Res"},{"key":"1349_CR24","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.cam.2018.02.010","volume":"340","author":"L Hervert-escobar","year":"2018","unstructured":"Hervert-escobar L, Alexandrov V (2018) Territorial design optimization for business sales plan. J Comput Appl Math 340:501\u2013507. https:\/\/doi.org\/10.1016\/j.cam.2018.02.010","journal-title":"J Comput Appl Math"},{"key":"1349_CR25","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0377-0427(00)00430-1","volume":"124","author":"KL Hoffman","year":"2000","unstructured":"Hoffman KL (2000) Combinatorial optimization: current successes and directions for the future. J Comput Appl Math 124:341\u2013360. https:\/\/doi.org\/10.1016\/S0377-0427(00)00430-1","journal-title":"J Comput Appl Math"},{"key":"1349_CR26","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/03155986.1989.11732083","volume":"27","author":"L Levy","year":"1989","unstructured":"Levy L, Bodin L (1989) The arc oriented location routing problem. INFOR Inf Syst Oper Res 27:74\u201394. https:\/\/doi.org\/10.1080\/03155986.1989.11732083","journal-title":"INFOR Inf Syst Oper Res"},{"key":"1349_CR27","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.apm.2017.10.041","volume":"55","author":"Y Liu","year":"2018","unstructured":"Liu Y, Lei H, Zhang D, Wu Z (2018) Robust optimization for relief logistics planning under uncertainties in demand and transportation time. Appl Math Model 55:262\u2013280. https:\/\/doi.org\/10.1016\/j.apm.2017.10.041","journal-title":"Appl Math Model"},{"key":"1349_CR28","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.cor.2013.10.003","volume":"43","author":"RB Lopes","year":"2014","unstructured":"Lopes RB, Plastria F, Ferreira C, Santos BS (2014) Location-arc routing problem: heuristic approaches and test instances. Comput Oper Res 43:309\u2013317. https:\/\/doi.org\/10.1016\/j.cor.2013.10.003","journal-title":"Comput Oper Res"},{"key":"1349_CR29","doi-asserted-by":"publisher","unstructured":"Mei Y, Tang K, Yao X (2010) Capacitated arc routing problem in uncertain environments. In: IEEE congress on evolutionary computation. Spain, pp 1\u20138. https:\/\/doi.org\/10.1109\/CEC.2010.5586031","DOI":"10.1109\/CEC.2010.5586031"},{"key":"1349_CR30","doi-asserted-by":"publisher","DOI":"10.3846\/transport.2019.11145","author":"S Mirzaei-khafri","year":"2019","unstructured":"Mirzaei-khafri S, Bashiri M, Soltani R (2019) A mathematical model for the capacitated location-arc routing problem with deadlines and heterogeneous fleet. Transport. https:\/\/doi.org\/10.3846\/transport.2019.11145","journal-title":"Transport"},{"key":"1349_CR31","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2012.729053","author":"SM Mousavi","year":"2013","unstructured":"Mousavi SM, Tavakkoli-Moghaddam R, Jolai F (2013) A possibilistic programming approach for the location problem of multiple cross-docks and vehicle routing scheduling under uncertainty problem of multiple cross-docks and vehicle routing. Eng Optim. https:\/\/doi.org\/10.1080\/0305215X.2012.729053","journal-title":"Eng Optim"},{"key":"1349_CR32","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"JM Mulvey","year":"1995","unstructured":"Mulvey JM, Vanderbei RJ, Zenios SA (1995) Robust optimization of large-scale systems. Oper Res 43:264\u2013281. https:\/\/doi.org\/10.1287\/opre.43.2.264","journal-title":"Oper Res"},{"key":"1349_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/19427867.2016.1270798","volume":"7867","author":"A Nadizadeh","year":"2019","unstructured":"Nadizadeh A, Kafash B (2019) Fuzzy capacitated location-routing problem with simultaneous pickup and delivery demands. Transp Lett 7867:1\u201319. https:\/\/doi.org\/10.1080\/19427867.2016.1270798","journal-title":"Transp Lett"},{"key":"1349_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5899\/2014\/dea-00063","volume":"2014","author":"A Nadizadeh","year":"2014","unstructured":"Nadizadeh A, Hosseini Nasab H, Sadeghieh A, Fakhrzad MB (2014) A location-routing problem model with multiple periods and fuzzy demands. Data Envel Anal Decis Sci 2014:1\u201324. https:\/\/doi.org\/10.5899\/2014\/dea-00063","journal-title":"Data Envel Anal Decis Sci"},{"key":"1349_CR35","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G Nagy","year":"2006","unstructured":"Nagy G, Salhi S (2006) Location-routing: Issues, models and methods. Eur J Oper Res 177:649\u2013672. https:\/\/doi.org\/10.1016\/j.ejor.2006.04.004","journal-title":"Eur J Oper Res"},{"key":"1349_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.01.005","volume":"238","author":"C Prodhon","year":"2014","unstructured":"Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur J Oper Res 238:1\u201317. https:\/\/doi.org\/10.1016\/j.ejor.2014.01.005","journal-title":"Eur J Oper Res"},{"key":"1349_CR37","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cor.2016.06.012","volume":"76","author":"JP Riquelme-Rodr\u00edguez","year":"2016","unstructured":"Riquelme-Rodr\u00edguez JP, Gamache M, Langevin A (2016) Location arc routing problem with inventory constraints. Comput Oper Res 76:84\u201394. https:\/\/doi.org\/10.1016\/j.cor.2016.06.012","journal-title":"Comput Oper Res"},{"key":"1349_CR38","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10479-017-2509-0","volume":"259","author":"M Schneider","year":"2017","unstructured":"Schneider M, Drexl M (2017) A survey of the standard location-routing problem. Ann Oper Res 259:389\u2013414. https:\/\/doi.org\/10.1007\/s10479-017-2509-0","journal-title":"Ann Oper Res"},{"key":"1349_CR39","doi-asserted-by":"publisher","unstructured":"Solano-Charris EL, Prins C, Santos AC (2014) A robust optimization approach for the vehicle routing problem with uncertain travel cost. In: Proceedings of international conference on control, decision and information technologies (CoDIT). IEEE, France, pp 98\u2013103. https:\/\/doi.org\/10.1109\/CoDIT.2014.6996875","DOI":"10.1109\/CoDIT.2014.6996875"},{"key":"1349_CR40","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1051\/ro\/2016048","volume":"50","author":"EL Solano-Charris","year":"2016","unstructured":"Solano-Charris EL, Prins C, Santos AC (2016) Solving the bi-objective robust vehicle routing problem with uncertain costs and demands. RAIRO Oper Res 50:689\u2013714. https:\/\/doi.org\/10.1051\/ro\/2016048","journal-title":"RAIRO Oper Res"},{"key":"1349_CR41","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21:1154\u20131157. https:\/\/doi.org\/10.1287\/opre.21.5.1154","journal-title":"Oper Res"},{"key":"1349_CR42","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1080\/07408170701745378","volume":"40","author":"I Sungur","year":"2008","unstructured":"Sungur I, Ord\u00f3\u00f1ez F, Dessouky M (2008) A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans 40:509\u2013523. https:\/\/doi.org\/10.1080\/07408170701745378","journal-title":"IIE Trans"},{"key":"1349_CR43","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.jmsy.2013.12.009","volume":"33","author":"N Tajik","year":"2014","unstructured":"Tajik N, Tavakkoli-Moghaddam R, Vahdani B, Meysam Mousavi S (2014) A robust optimization approach for pollution routing problem with pickup and delivery under uncertainty. J Manuf Syst 33:277\u2013286. https:\/\/doi.org\/10.1016\/j.jmsy.2013.12.009","journal-title":"J Manuf Syst"},{"key":"1349_CR44","doi-asserted-by":"publisher","unstructured":"Tavakkoli-Moghaddam R, Amini A, Ebrahimnejad S (2018) A new mathematical model for a multi-product location-arc routing problem. In: 4th international conference on optimization and applications (ICOA). IEEE, Morocco, pp 1\u20135. https:\/\/doi.org\/10.1109\/ICOA.2018.8370551","DOI":"10.1109\/ICOA.2018.8370551"},{"key":"1349_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.124343","author":"ME Tayebi-Araghi","year":"2020","unstructured":"Tayebi-Araghi ME, Tavakkoli-Moghaddam R, Jolai F, Haji Molana SM (2020) A green multi-facilities open location-routing problem with planar facility locations and uncertain customer. J Clean Prod. https:\/\/doi.org\/10.1016\/j.jclepro.2020.124343","journal-title":"J Clean Prod"},{"key":"1349_CR46","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.wasman.2018.03.015","volume":"76","author":"EB Tirkolaee","year":"2018","unstructured":"Tirkolaee EB, Mahdavi I, Seyyed Esfahani M (2018) A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew\u2019s working time. Waste Manag 76:138\u2013146. https:\/\/doi.org\/10.1016\/j.wasman.2018.03.015","journal-title":"Waste Manag"},{"key":"1349_CR47","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1016\/j.jclepro.2016.11.115","volume":"167","author":"Y Xiao","year":"2017","unstructured":"Xiao Y, Konak A (2017) A genetic algorithm with exact dynamic programming for the green vehicle routing and scheduling problem. J Clean Prod 167:1450\u20131463. https:\/\/doi.org\/10.1016\/j.jclepro.2016.11.115","journal-title":"J Clean Prod"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01349-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-020-01349-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01349-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T22:31:47Z","timestamp":1607639507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-020-01349-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,10]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1349"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01349-7","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,10]]},"assertion":[{"value":"18 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"318"}}