Two exact algorithms for the vehicle routing problem on trees
From MaRDI portal
Recommendations
- A framework for vehicle routing approximation schemes in trees
- Two exact algorithms for the distance-constrained vehicle routing problem
- scientific article; zbMATH DE number 3989085
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- scientific article; zbMATH DE number 1522939
- scientific article; zbMATH DE number 1303035
- Capacitated Vehicle Routing on Trees
- A polynomial-time exact algorithm for k-depot capacitated vehicle routing problem on a tree
Cited in
(8)- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- Heuristics for vehicle routing on tree-like networks
- Modeling and solving the capacitated vehicle routing problem on trees
- scientific article; zbMATH DE number 3914114 (Why is no real title available?)
- scientific article; zbMATH DE number 1184494 (Why is no real title available?)
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A polynomial-time exact algorithm for k-depot capacitated vehicle routing problem on a tree
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees
This page was built for publication: Two exact algorithms for the vehicle routing problem on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238575)