Improved approximation algorithms for cumulative VRP with stochastic demands

dc.contributor.author	Gaur, D.R.
dc.contributor.author	Mudgal, A.
dc.contributor.author	Singh, R.R.
dc.date.accessioned	2018-12-22T06:06:21Z
dc.date.available	2018-12-22T06:06:21Z
dc.date.issued	2018-12-22
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/1059
dc.description.abstract	In this paper, we give randomized approximation algorithms for stochastic cumulative VRPs for the split and unsplit deliveries. The approximation ratios are max{1+1.5α, 3} and 6, respectively, where α is the approximation ratio for the metric TSP. The approximation factor is further reduced for trees. These results extend the results in Anupam Gupta et al. (2012) and Daya Ram Gaur et al. (2013). The bounds reported here improve the bounds in Daya Ram Gaur et al. (2016).	en_US
dc.language.iso	en_US	en_US
dc.subject	Approximation algorithms	en_US
dc.subject	Cumulative VRPs	en_US
dc.subject	Stochastic demand	en_US
dc.title	Improved approximation algorithms for cumulative VRP with stochastic demands	en_US
dc.type	Article	en_US