A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments

Published:2017-04-08 Issue:3 Volume:70 Page:262-278
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:NETWORKS

Author:

van Bevern René¹²^ORCID,Komusiewicz Christian³,Sorge Manuel⁴

Affiliation:

1. Novosibirsk State University; Novosibirsk Russian Federation

2. Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences; Novosibirsk Russian Federation

3. Institut für Informatik, Friedrich-Schiller-Universität Jena; Germany

4. Institut für Softwaretechnik und Theoretische Informatik; TU Berlin Germany

Funder

Russian Foundation for Basic Research

German Research Foundation

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference41 articles.

1. A. Asadpour M.X. Goemans A. Mądry S.O. Gharan A. Saberi An O ( log n / log log n ) -approximation algorithm for the asymmetric Traveling Salesman Problem 2010 379 389 10.1137/1.9781611973075.32

2. Route first-Cluster second methods for vehicle routing;Beasley;Omega,1983

3. Lower and upper bounds for the mixed capacitated arc routing problem;Belenguer;Comput Oper Res,2006

4. Dynamic programming treatment of the Travelling Salesman Problem;Bellman;J ACM,1962

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Line Coverage With Multiple Robots: Algorithms and Experiments;IEEE Transactions on Robotics;2024

2. Approximation Algorithms for the Min–Max Mixed Rural Postmen Cover Problem and Its Variants;Algorithmica;2023-11-23

3. The single robot line coverage problem: Theory, algorithms, and experiments;Networks;2023-07-25

4. Polynomial-time data reduction for weighted problems beyond additive goal functions;Discrete Applied Mathematics;2023-03

5. Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem;Proceedings of the Steklov Institute of Mathematics;2022-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3