✦ 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
DOI: 10.1002/net.20334

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New facets and an enhanced branch-and-cu

New facets and an enhanced branch-and-cut for the min–max K-vehicles windy rural postman problem

✍ Enrique Benavent; Angel Corberán; Isaac Plana; José M. Sanchis 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB

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