{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:13:11Z","timestamp":1720051991495},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T00:00:00Z","timestamp":1718409600000},"content-version":"vor","delay-in-days":1475,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","award":["NSERC-DG-06302"],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ISIRD","award":["ISIRD\/10-11\/AM\/19"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1016\/j.dam.2018.01.012","type":"journal-article","created":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T23:49:26Z","timestamp":1521935366000},"page":"133-143","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["Improved approximation algorithms for cumulative VRP with stochastic demands"],"prefix":"10.1016","volume":"280","author":[{"given":"Daya Ram","family":"Gaur","sequence":"first","affiliation":[]},{"given":"Apurva","family":"Mudgal","sequence":"additional","affiliation":[]},{"given":"Rishi Ranjan","family":"Singh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.dam.2018.01.012_b1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(87)90012-5","article-title":"Heuristics for unequal weight delivery problems with a fixed error guarantee","volume":"6","author":"Altinkemer","year":"1987","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"10.1016\/j.dam.2018.01.012_b2","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/j.trc.2009.12.006","article-title":"Complexity of the VRP and SDVRP","volume":"19","author":"Archetti","year":"2011","journal-title":"Transp. Res. C"},{"issue":"5","key":"10.1016\/j.dam.2018.01.012_b3","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","article-title":"Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/j.dam.2018.01.012_b4","series-title":"Probabilistic Combinatorial Optimization Problems","author":"Bertsimas","year":"1988"},{"issue":"3","key":"10.1016\/j.dam.2018.01.012_b5","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1287\/opre.40.3.574","article-title":"A vehicle routing problem with stochastic demand","volume":"40","author":"Bertsimas","year":"1992","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.dam.2018.01.012_b6","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/opre.44.2.286","article-title":"A new generation of vehicle routing research: robust algorithms, addressing uncertainty","volume":"44","author":"Bertsimas","year":"1996","journal-title":"Oper. Res."},{"key":"10.1016\/j.dam.2018.01.012_b7","series-title":"Worst-case analysis of a new heuristic for the travelling salesman problem, Technical report","author":"Christofides","year":"1976"},{"issue":"1","key":"10.1016\/j.dam.2018.01.012_b8","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/j.dam.2018.01.012_b9","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/j.ejor.2013.12.033","article-title":"A review of recent research on green road freight transportation","volume":"237","author":"Demir","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"6","key":"10.1016\/j.dam.2018.01.012_b10","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.orl.2013.07.007","article-title":"Routing vehicles to minimize fuel consumption","volume":"41","author":"Gaur","year":"2013","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.dam.2018.01.012_b11","series-title":"Algorithms and Discrete Applied Mathematics","first-page":"176","article-title":"Approximation algorithms for cumulative VRP with stochastic demands","author":"Gaur","year":"2016"},{"key":"10.1016\/j.dam.2018.01.012_b12","series-title":"Algorithms and Discrete Applied Mathematics","first-page":"262","article-title":"Cumulative vehicle routing problem: A column generation approach","author":"Gaur","year":"2015"},{"key":"10.1016\/j.dam.2018.01.012_b13","article-title":"A heuristic for cumulative vehicle routing using column generation","author":"Gaur","year":"2016","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2018.01.012_b14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","article-title":"Stochastic vehicle routing","volume":"88","author":"Gendreau","year":"1996","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.dam.2018.01.012_b15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","article-title":"Capacitated arc routing problems","volume":"11","author":"Golden","year":"1981","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.dam.2018.01.012_b16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1287\/opre.1110.0967","article-title":"Technical note - Approximation algorithms for VRP with stochastic demands","volume":"60","author":"Gupta","year":"2012","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.dam.2018.01.012_b17","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","article-title":"Bounds and heuristics for capacitated routing problems","volume":"10","author":"Haimovich","year":"1985","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.dam.2018.01.012_b18","series-title":"Combin. Optim. Appl.","first-page":"62","article-title":"Energy minimizing vehicle routing problem","author":"Kara","year":"2007"},{"key":"10.1016\/j.dam.2018.01.012_b19","first-page":"85","article-title":"Cumulative vehicle routing problems","author":"Kara","year":"2008","journal-title":"Veh. Routing Probl."},{"issue":"4","key":"10.1016\/j.dam.2018.01.012_b20","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/opre.39.4.616","article-title":"Capacitated vehicle routing on trees","volume":"39","author":"Labb\u00e9","year":"1991","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.dam.2018.01.012_b21","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1137\/S0097539796309764","article-title":"Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems","volume":"28","author":"Mitchell","year":"1999","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.dam.2018.01.012_b22","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0377-2217(83)90237-0","article-title":"Stochastic vehicle routing: A comprehensive approach","volume":"14","author":"Stewart","year":"1983","journal-title":"European J. Oper. Res."},{"issue":"7","key":"10.1016\/j.dam.2018.01.012_b23","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1016\/j.cor.2011.08.013","article-title":"Development of a fuel consumption optimization model for the capacitated vehicle routing problem","volume":"39","author":"Xiao","year":"2012","journal-title":"Comput. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X18300696?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X18300696?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T11:06:11Z","timestamp":1718449571000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X18300696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":23,"alternative-id":["S0166218X18300696"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2018.01.012","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2020,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improved approximation algorithms for cumulative VRP with stochastic demands","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2018.01.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}