Chinese postman problem
The Chinese Postman Problem acquired its name from the context in which it was first popularly presented. The Chinese mathematician Mei-Ko Kwan (1962)addressed the question of how, given a postal zone with a number of streets that must be served by a postal carrier (postman), does one develop a tour or route that covers every street in the zone and brings the postman back to his point of origin having traveled the minimum possible distance. Researchers who have followed on Kwan's initial work have since referred to this problem as the Chinese Postman Problem or CPP. In general, any problem that requires that all of the edges of a graph (streets, etc.) be traversed (served) at least once while traveling the shortest total distance overall is a CPP. Like its cousin, the traveling salesman problem, that seeks a route of minimum cost that visits every vertex of a graph exactly once before returning to the vertex of origin, the CPP has many real world manifestations, not the least of...
- Christofides, N. (1973). “The Optimal Traversal of a Graph,” Omega, 1, 719–732.Google Scholar
- Edmonds, J. and Johnson, E. (1973). “Matching, Euler Tours, and the Chinese Postman Problem,” Mathematical Programming, 5, 88–124.Google Scholar
- Kwan, M. K. (1962). “Graphic Programming Using Odd or Even Points,” Chinese Mathematics, 1, 273–277.Google Scholar
- Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H.G., and Shmoys, D. B., eds. (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester, UK.Google Scholar