Date of Award
2000
Document Type
Project
Degree Name
Master of Arts in Mathematics
Department
Mathematics
Abstract
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.
Recommended Citation
Cramm, Kenneth Peter, "Solutions to the Chinese Postman Problem" (2000). Theses Digitization Project. 1683.
https://scholarworks.lib.csusb.edu/etd-project/1683
