Route Inspection Problem

In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an Eulerian circuit (a closed walk that covers every edge once), that circuit is an optimal solution.

Alan Goldman of the U.S. National Bureau of Standards first coined the name 'Chinese Postman Problem' for this problem, as it was originally studied by the Chinese mathematician Mei-Ku Kuan in 1962.

Read more about Route Inspection Problem:  Eulerian Paths and Circuits, T-joins, Solution, Variants

Famous quotes containing the words route, inspection and/or problem:

    no arranged terror: no forcing of image, plan,
    or thought:
    no propaganda, no humbling of reality to precept:
    terror pervades but is not arranged, all possibilities
    of escape open: no route shut,
    Archie Randolph Ammons (b. 1926)

    Thus the orb he roamed
    With narrow search, and with inspection deep
    Considered every creature, which of all
    Most opportune might serve his wiles, and found
    The serpent subtlest beast of all the field.
    John Milton (1608–1674)

    Our political problem now is “Can we, as a nation, continue together permanentlyforever—half slave, and half free?” The problem is too mighty for me. May God, in his mercy, superintend the solution.
    Abraham Lincoln (1809–1865)