Chinese Postman WWW Page
The Chiense Postman problem is like Travel sales man problem. In this the
postman wants to travel to a number of houses in the minimum time
possible. Some of the few examples of this are:
1. Testing of current/telephone lines and roads.
2. The route of a insurance agent.
3. The optimal route through a museum.
The implementation of Chinses problem is in Microsoft Visual C++. This
problem uses the following algorithms whose implementaion are also
included:
1. Floyd's algorithm
2. Minimum Perfect matching
3. Dijkstra's Algorithm
4. Eularian Trails
The Implementation provided here can sove problems sizes of
over 200 points.
Download Files (local site)Dominic Battré's Webpage(in German)
Problem Links
This page last modified on 2008-07-10
.
www.algorist.com
