Access the full text.
Sign up today, get DeepDyve free for 14 days.
T. Asano, N. Katoh, Kazuhiro Kawashima (1999)
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a TreeJournal of Combinatorial Optimization, 5
Amariah Becker, P. Klein, Aaron Schild (2019)
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
Anna Adamaszek, A. Czumaj, A. Lingas (2009)
PTAS for k-tour cover problem on the plane for moderately large values of kArXiv, abs/0904.2576
[ (1990)
Heuristics for delivery problems with constant error guaranteesTransport. Sci., 24
M. Khachay, R. Dubinin (2016)
PTAS for the Euclidean Capacitated Vehicle Routing Problem in R^d
[ (2002)
The Vehicle Routing ProblemSociety for Industrial and Applied Mathematics.
Amariah Becker, Alice Paul (2018)
A Framework for Vehicle Routing Approximation Schemes in Trees
Nicolas Jozefowiez, F. Semet, El-Ghazali Talbi (2007)
The vehicle routing problem: Latest advances and new challenges
J. Blauth, Vera Traub, J. Vygen (2020)
Improving the approximation ratio for capacitated vehicle routingMathematical Programming, 197
S. Anbuudayasankar, K. Ganesh, S. Mohapatra (2014)
Models for Practical Routing Problems in Logistics
T. Crainic, G. Laporte (1998)
Fleet management and logisticsJournal of the Operational Research Society, 50
[ (2022)
A Tight \((1Retrieved from https://arxiv.org/abs/2202.05691.
Amariah Becker, P. Klein, David Saulpic (2017)
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
[ (2021)
Improving the approximation ratio for capacitated vehicle routingInternational Conference on Integer Programming and Combinatorial Optimization. Springer
M. Haimovich, A. Kan (1985)
Bounds and Heuristics for Capacitated Routing ProblemsMath. Oper. Res., 10
[ (2012)
Fleet Management and LogisticsSpringer Science & Business Media.
K. Altinkemer, B. Gavish (1990)
Technical Note - Heuristics for Delivery Problems with Constant Error GuaranteesTransp. Sci., 24
A. Bompadre, M. Dror, J. Orlin (2006)
Improved bounds for vehicle routing solutionsDiscret. Optim., 3
T. Asano, N. Katoh, H. Tamaki, T. Tokuyama (1997)
Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k
Claire Mathieu, Hang Zhou (2023)
A Tight (1.5+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees
Amariah Becker (2018)
A Tight 4/3 Approximation for Capacitated Vehicle Routing in TreesArXiv, abs/1804.08791
Vincent Cohen-Addad, Arnold Filtser, P. Klein, Hung Le (2020)
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
Aparna Das, Claire Mathieu (2008)
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle RoutingAlgorithmica, 73
assume without loss of generality that, for each i ∈ Z and for each (u, v) ∈ F i , max
[ (2016)
PTAS for the euclidean capacitated vehicle routing problem in \(\mathbb {R}^d\)International Conference on Discrete Optimization and Operations Research. Springer
B. Golden, R. Wong (1981)
Capacitated arc routing problemsNetworks, 11
Shin-ya Hamaguchi, N. Katoh (1998)
A Capacitated Vehicle Routing Problem on a Tree
Yong Wang, Xiaolei Ma, Yunteng Lao, Yinhai Wang, H. Mao (2013)
Vehicle Routing ProblemTransportation Research Record, 2378
G. Dantzig, J. Ramser (1959)
The Truck Dispatching ProblemManagement Science, 6
M. Labbé, G. Laporte, H. Mercure (1991)
Capacitated Vehicle Routing on TreesOper. Res., 39
Amariah Becker, P. Klein, David Saulpic (2018)
Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, M. Salavatipour (2021)
Improved Approximations for CVRP with Unsplittable DemandsArXiv, abs/2111.08138
Aditya Jayaprakash, M. Salavatipour (2021)
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway DimensionACM Transactions on Algorithms, 19
We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routing problem (CVRP) on trees, for the entire range of the tour capacity. The result extends to the splittable CVRP.
ACM Transactions on Algorithms (TALG) – Association for Computing Machinery
Published: Mar 10, 2023
Keywords: Approximation algorithms
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.