A framework for vehicle routing approximation schemes in trees
From MaRDI portal
(Redirected from Publication:2285087)
Recommendations
- Linear time approximation schemes for vehicle scheduling problems
- scientific article; zbMATH DE number 2089206
- scientific article; zbMATH DE number 1522939
- A polynomial-time exact algorithm for k-depot capacitated vehicle routing problem on a tree
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
Cited in
(15)- Improved approximations for capacitated vehicle routing with unsplittable client demands
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
- A PTAS for bounded-capacity vehicle routing in planar graphs
- scientific article; zbMATH DE number 1184494 (Why is no real title available?)
- Capacitated Vehicle Routing on Trees
- Two exact algorithms for the vehicle routing problem on trees
- scientific article; zbMATH DE number 1303035 (Why is no real title available?)
- A PTAS for Capacitated Vehicle Routing on Trees
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
- Improved approximations for the capacitated vehicle routing problem with fixed capacity
- A tight (1.5+)-approximation for unsplittable capacitated vehicle routing on trees
- Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
- Approximation algorithm for the min-max partial tree cover problem
- The multiple traveling salesman problem on spiders
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees
This page was built for publication: A framework for vehicle routing approximation schemes in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285087)
