𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for distance constrained vehicle routing problems

✍ Scribed by Viswanath Nagarajan; R. Ravi

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
104 KB
Volume
59
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation results for min-max path c
Approximation results for min-max path cover problems in vehicle routing
✍ Zhou Xu; Liang Xu; Chung-Lun Li πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 410 KB

## Abstract This article studies a min‐max path cover problem, which is to determine a set of paths for __k__ capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when

Two exact algorithms for the vehicle rou
Two exact algorithms for the vehicle routing problem on trees
✍ Pontien Mbaraga; AndrΓ© Langevin; Gilbert Laporte πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 80 KB πŸ‘ 2 views

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe

Approximation Algorithms for Directed St
Approximation Algorithms for Directed Steiner Problems
✍ Moses Charikar; Chandra Chekuri; To-yat Cheung; Zuo Dai; Ashish Goel; Sudipto Gu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 181 KB

We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing.