✦ LIBER ✦

Algorithms for the Windy Postman Problem

✍ Scribed by Wen Lea Pearn; Mao Lin Li

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 943 KB
Volume: 21
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(94)90079-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the windy postman problem

✍ Meigu Guan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 325 KB

Algorithms for the rural postman problem

✍ W.L. Pearn; T.C. Wu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 668 KB

Min-Max K-vehicles windy rural postman p

Min-Max K-vehicles windy rural postman problem

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

Algorithms for the Chinese postman probl

Algorithms for the Chinese postman problem on mixed networks

✍ Wen Lea Pearn; C.M. Liu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 685 KB

On crossings, the Crossing Postman Probl

On crossings, the Crossing Postman Problem, and the Rural Postman Problem

✍ Garfinkel, Robert S.; Webb, Ian R. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

The Rural Postman Problem (RPP), on an undirected network, is a classic edge-routing problem. The Crossing Postman Problem is a generalization which is introduced here. Results are presented on the structure of optimal solutions to both problems. A new formulation for RPP, based on these results, is

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