Abstract
Let a connected graph G = (V,E) and nonnegative integer/real edge weights c. for e. € E be given. Then a tour in G is a sequence T = (v1,e1,v2,e2,...,vk,ek,vk+1 = v1) of nodes vi and edges ei such that e. meets the nodes vi and vi+1. A postman tour in G is a tour which contains every edge at least once.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Burkard, R.E., Derigs, U. (1980). The Chinese Postman Problem. In: Assignment and Matching Problems: Solution Methods with FORTRAN-Programs. Lecture Notes in Economics and Mathematical Systems, vol 184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51576-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-51576-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10267-0
Online ISBN: 978-3-642-51576-7
eBook Packages: Springer Book Archive