Skip to main content

Consortium for Mathematics and its Applications

Product ID: 99582
Supplementary Print
Undergraduate
High School

The Chinese Postman Problem (UMAP)

Author: V.K. Balakrishnan


A unit that applies finite mathematics to optimization focusing on the Chinese Postman Problem. This module introduces ideas from network and graph theory to find optimal routes. Students analyze networks and construct optimal routes for networks in which all streets are two-way streets.

Table of Contents:

1. DESCRIPTION OF THE PROBLEM

2. GRAPHS AND NETWORKS

3. EULERIAN AND HAMILTONIAN GRAPHS

4. EXISTENCE AND CONSTRUCTION OF EULERIAN CIRCUITS

5. COMPLETE AND MINIMAL MATCHINGS

6. CONSTRUCTION OF OPTIMAL ROUTES

7. ANSWERS TO EXERCISES

8. REFERENCES

©1983 by COMAP, Inc.
UMAP Module
19 pages

Mathematics Topics:

Discrete & Finite Mathematics , Computer Science

Application Areas:

Computers & Technology , Optimization

Prerequisites:

High school algebra

You must have a Full Membership to download this resource.

If you're already a member, login here.

Not yet a member?