Approximation Algorithms for the Multi-Vehicle Scheduling Problem
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/978-3-642-17514-5_17
Reference17 articles.
1. Augustine, J.E., Seiden, S.: Linear time approximation schemes for vehicle scheduling problems. Theoretical Computer Science 324(2-3), 147–160 (2004)
2. Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 166–174 (2004)
3. Bar-Yehuda, R., Even, G., Shahar, S.: On approximating a geometric prize-collecting traveling salesman problem with time windows. In: Proceedings of the 11th Annual European Symposium on Algorithms, pp. 55–66 (2003)
4. Bhattacharya, B.K., Carmi, P., Hu, Y., Shi, Q.: Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. In: Proceedings of the 19th International Symposium on Algorithms and Computation, pp. 800–811 (2008)
5. Dantzig, G.B., Ramser, R.H.: The truck dispatching problem. Management Science 6, 80–91 (1959)
Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems;Tsinghua Science and Technology;2023-10
2. Deep reinforcement learning for urban multi-taxis cruising strategy;Neural Computing and Applications;2022-04-27
3. New LP relaxations for Minimum Cycle/Path/Tree Cover Problems;Theoretical Computer Science;2020-01
4. Improved algorithms for single vehicle scheduling on tree/cycle networks;Journal of Combinatorial Optimization;2019-05-20
5. Better approximability results for min–max tree/cycle/path cover problems;Journal of Combinatorial Optimization;2018-03-01
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3