Category:Chinese Postman Problems
Jump to navigation
Jump to search
This category contains results about Chinese Postman Problems.
Definitions specific to this category can be found in Definitions/Chinese Postman Problems.
A Chinese postman problem is a problem in network theory equivalent to that of a postman who needs to:
- visit all streets in an area to deliver letters
- return to the starting point
- covering the least possible distance.
Hence it is equivalent to finding a closed walk in a weighted graph which includes every edge with least total weight.
This category currently contains no pages or media.