✦ LIBER ✦

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

✍ Scribed by Garfinkel, Robert S.; Webb, Ian R.

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 125 KB
Volume: 34
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199910)34:3<173::aid-net1>3.0.co;2-w

No coin nor oath required. For personal study only.

✦ Synopsis

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 given.

📜 SIMILAR VOLUMES

Algorithms for the rural postman problem

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

On the windy postman problem

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

On the mixed Chinese postman problem

✍ T.K. Ralphs 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 289 KB

On the mixed Chinese postman problem

✍ T.K. Ralphs 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 289 KB

The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation pol

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 Windy Postman Problem

✍ Wen Lea Pearn; Mao Lin Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 943 KB