The Postman Problem

  • Loo-Keng Hua
  • Yuan Wang
  • J. G. C. Heijmans
Part of the Mathematical Modeling book series (MMO, volume 2)


Every day a postman will start from the post office and traverse through certain streets to deliver and collect letters and then return to the post office. A natural question to ask is whether there is a rule by which we can find a route that includes all streets he has to pass through so that the length of the route is a minimum. The routing of the garbage trucks in large cities is a similar problem.


Feasible Solution Transportation Problem Normal Solution Post Office Euler Tour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Guan Mei Gu. Graphic Programming using Odd and Even Points. Acta Math. Sinica, 10, 3, 1960, 263–266. (also: Chinese Math 1, 1962, 273–277 ).Google Scholar
  2. Lawler, E.L. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.Google Scholar
  3. Lovász, L. and M.D. Plummer. Matching Theory. Annals of Discrete Mathematics, 29, North Holland, 1986.Google Scholar

Copyright information

© Birkhäuser Boston 1989

Authors and Affiliations

  • Loo-Keng Hua
  • Yuan Wang
    • 1
  • J. G. C. Heijmans
    • 2
  1. 1.Academia SinicaInstitute of MathematicsBeijingPeople’s Republic of China
  2. 2.Department of MathematicsUniversity of Texas at ArlingtonArlingtonUSA

Personalised recommendations