Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-030-22629-9_22
Reference31 articles.
1. Adamaszek, A., Czumaj, A., Lingas, A.: PTAS for k-tour cover problem on the plane rof moderately large values of $$k$$ . Int. J. Found. Comput. Sci. 21(06), 893–904 (2010). https://doi.org/10.1142/S0129054110007623
2. Arora, S.: Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other geometric problems. J. ACM 45, 753–782 (1998)
3. Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 275–283. ACM, New York (1997). https://doi.org/10.1145/258533.258602
4. Becker, A., Klein, P.N., Saulpic, D.: A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs. In: Pruhs, K., Sohler, C. (eds.) 25th Annual European Symposium on Algorithms, ESA 2017, Vienna, Austria, 4–6 September 2017. LIPIcs, vol. 87, pp. 12:1–12:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017). https://doi.org/10.4230/LIPIcs.ESA.2017.12 . http://www.dagstuhl.de/dagpub/978-3-95977-049-1
5. Becker, A., Klein, P.N., Saulpic, D.: Polynomial-time approximation schemes for k-center, k-median, and capacitated vehicle routing in bounded highway dimension. In: Azar, Y., Bast, H., Herman, G. (eds.) 26th Annual European Symposium on Algorithms, ESA 2018, Helsinki, Finland, 20–22 August 2018. LIPIcs, vol. 112, pp. 8:1–8:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). https://doi.org/10.4230/LIPIcs.ESA.2018.8 . http://www.dagstuhl.de/dagpub/978-3-95977-081-1
Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment;Applied Sciences;2024-03-29
2. Approximation Schemes for Capacity Vehicle Routing Problems: A Survey;2023 2nd International Conference on Computational Modelling, Simulation and Optimization (ICCMSO);2023-06-23
3. A novel model and algorithm for designing an eco-oriented demand responsive transit (DRT) system;Transportation Research Part E: Logistics and Transportation Review;2022-01
4. Approximation of the Capacitated Vehicle Routing Problem with a Limited Number of Routes in Metric Spaces of Fixed Doubling Dimension;Computational Mathematics and Mathematical Physics;2021-07
5. Efficient approximation of the metric CVRP in spaces of fixed doubling dimension;Journal of Global Optimization;2021-01-29
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3