𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Min-Max K-vehicles windy rural postman problem

✍ Scribed by Enrique Benavent; Angel Corberán; Isaac Plana; José M. Sanchis


Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
173 KB
Volume
54
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Approximation results for min-max path c
✍ 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