Considering the Chinese Postman Problem, in which a mailman must deliver mail to houses in a neighborhood. The mailman must cover each side of the street that has houses, at least once. The focus of this paper is our attempt to discover the optimal path, or the least number of times each street is walked. The integration of algorithms from graph theory and operations research form the method used to explain solutions to the Chinese Postman Problem.
| Identifer | oai:union.ndltd.org:csusb.edu/oai:scholarworks.lib.csusb.edu:etd-project-2683 |
| Date | 01 January 2000 |
| Creators | Cramm, Kenneth Peter |
| Publisher | CSUSB ScholarWorks |
| Source Sets | California State University San Bernardino |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses Digitization Project |
Page generated in 0.0017 seconds