Skip Navigation

The Computer Journal 1978 21(1):86-89; doi:10.1093/comjnl/21.1.86
© 1978 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Barlow, J. F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An algorithm for the solution of the postman's problem

J. F. Barlow *

Institute for Industrial Research and Standards, Ballymun Road, Dublin, UK

The postman's problem may be defined as follows: given an interconnected network of streets, the postman must cover every street of the network so that his path is as short as possible. This paper describes an algorithm, which produces solutions to real planar street plans within feasible limits of both computer time and storage.

Received September 1976.

* Institute for Industrial Research and Standards, Ballymun Road, Dublin 9, Eire


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.