𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for the rural postman problem

✍ Scribed by W.L. Pearn; T.C. Wu


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
668 KB
Volume
22
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On crossings, the Crossing Postman Probl
✍ 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

The rural postman problem with deadline
✍ A.N. Letchford; R.W. Eglese πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 694 KB

Vehicle routing problems with general time windows are extremely difficult to solve, tlowever, the time windows in a particular problem may have a special structure which can be exploited. We consider a single-vehicle arc-routing problem in which the arcs are partitioned into deadline classes. It is

Min-Max K-vehicles windy rural postman p
✍ Enrique Benavent; Angel CorberΓ‘n; Isaac Plana; JosΓ© M. Sanchis πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 173 KB
On the windy postman problem
✍ Meigu Guan πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 325 KB