☆ 4.2 Article

A PTAS for Capacitated Vehicle Routing on Trees

ACM TRANSACTIONS ON ALGORITHMS (2023)

Related references

Note: Only part of the references are listed.
Article Computer Science, Theory & Methods

A PTAS for Capacitated Vehicle Routing on Trees

Claire Mathieu et al.

Summary: We propose a PTAS for solving the unit demand capacitated vehicle routing problem (CVRP) on trees, covering all possible tour capacities. The same approach can be extended to the splittable CVRP.

ACM TRANSACTIONS ON ALGORITHMS (2023)

Add to Collection
Article Computer Science, Software Engineering

A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing

Aparna Das et al.

ALGORITHMICA (2015)

Add to Collection
Article Computer Science, Theory & Methods

PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k

Anna Adamaszek et al.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2010)

Add to Collection
Article Operations Research & Management Science

Improved bounds for vehicle routing solutions

Agustin Bompadre et al.

DISCRETE OPTIMIZATION (2006)

Add to Collection
Article Computer Science, Interdisciplinary Applications

A new approximation algorithm for the capacitated vehicle routing problem on a tree

T Asano et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2001)

Add to Collection
Webinars Posters Questions Hubs Funding Journals Papers Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.