๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Arc Routing Problems, Part II: The Rural Postman Problem

โœ Scribed by H. A. Eiselt, Michel Gendreau and Gilbert Laporte

Book ID
111653147
Publisher
INFORMS
Year
1995
Tongue
English
Weight
639 KB
Volume
43
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Reoptimizing the rural postman problem
Reoptimizing the rural postman problem
โœ Archetti, C.; Guastaroba, G.; Speranza, M.G. ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 292 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

The rural postman problem with deadline
The rural postman problem with deadline classes
โœ 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