{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-project-2683"},"canonical_url":"https://search.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-project-2683","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"Solutions to the Chinese Postman Problem","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Cramm, Kenneth Peter"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Project","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:05:25Z","subjects":["Leonhard Euler 1707-1783","Graph theory","Mathematical optimization","Algebra","Combinatorial optimization"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd-project/1683","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://scholarworks.lib.csusb.edu/etd-project/1683","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://scholarworks.lib.csusb.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ascholarworks.lib.csusb.edu%3Aetd-project-2683","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Cramm, Kenneth Peter"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2000-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Project"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Leonhard Euler 1707-1783","Graph theory","Mathematical optimization","Algebra","Combinatorial optimization"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd-project/1683"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Solutions to the Chinese Postman Problem"]}]}],"canonical_facts":{"dc:creator":["Cramm, Kenneth Peter"],"dc:date.created":["2000-01-01T08:00:00Z"],"dc:description.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."],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd-project/1683"],"dc:subject":["Leonhard Euler 1707-1783","Graph theory","Mathematical optimization","Algebra","Combinatorial optimization"],"dc:title":["Solutions to the Chinese Postman Problem"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Project"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-11-19T08:05:25Z"}