Mathematical Programming

, Volume 5, Issue 1, pp 88–124 | Cite as

Matching, Euler tours and the Chinese postman

  • Jack Edmonds
  • Ellis L. Johnson


The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The algorithm is a specialization of the more generalb-matching blossom algorithm. Algorithms for finding Euler tours and related problems are also discussed.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    van Aardenne-Ehrenfest and N.G. de Bruijn, “Circuits and trees in oriented graphs”,Simon Stevin 28 (1951) 203–217.Google Scholar
  2. [2]
    E.J. Beltrami and L.D. Bodin, “Networks and vehicle routing for municipal waste collection”, Report No. UPS 72-18, State University of New York, Stony Brook, N.Y. (1972).Google Scholar
  3. [3]
    C. Berge,The theory of graphs and its applications (Wiley, New York, 1962).Google Scholar
  4. [4]
    J. Edmonds, “Paths, trees and flowers”,Canadian Journal of Mathematics 17 (1965) 449–467.Google Scholar
  5. [5]
    J. Edmonds, “Maximum matching and a polyhedron with 0, 1-vertices”,Journal of Research of the National Bureau of Standards Section B, 1, 2 (1965) 125–130.Google Scholar
  6. [6]
    J. Edmonds, “The Chinese postman problem”,Operations Research 13 Suppl. 1 (1965) 373.Google Scholar
  7. [7]
    J. Edmonds and E.L. Johnson, “Matching: a well-solved class of integer linear programs”, in:Combinatorial structures and their applications (Gordon and Breach, New York, 1970) 89–92.Google Scholar
  8. [8]
    J. Edmonds, E.L. Johnson and S. Lockhart, “Blossom I: a computer code for the matching problem”, to appear.Google Scholar
  9. [9]
    L. Euler, “Solutio problematis ad geometriam situs pertinentis”,Commentarii Academiae Petropolitanae 8 (1736) 128–140.Google Scholar
  10. [10]
    L.R. Ford Jr. and D.R. Fulkerson,Flows in networks (Princeton Univ. Press, Princeton, N.J., 1962).Google Scholar
  11. [11]
    A.J. Hoffman, “Some recent applications of the theory of linear inequalities to extremal combinatorial analysis”, in:Proceedings of Symposia on Applied Mathematics Vol. 10 (American Mathematical Society, Providence, R.I., 1960).Google Scholar
  12. [12]
    T.C. Hu, “Revised matrix algorithms for shortest paths in a network“,SIAM Journal 15 (1967) 207–218.Google Scholar
  13. [13]
    T.M. Liebling,Graphentheorie in Planungs- und Tourenproblemen, Lecture Notes in Operations Research and Mathematical Systems 21 (Springer, Berlin, 1970).Google Scholar
  14. [14]
    K. Mei-Ko, “Graphic programming using odd or even points”,Chinese Mathematics 1 (1962) 273–277.Google Scholar
  15. [15]
    C.S. Orloff, “Routing and scheduling a fleet of vehicles to/from central facilities — the school bus problem”, Ph. D. Thesis, Cornell University, Ithaca, N.Y. (1972).Google Scholar
  16. [16]
    R. Stricker, “Public sector vehicle routing: the Chinese postman problem”, Master Thesis, Massachusetts Institute of Technology, Cambridge, Mass. (August 1970).Google Scholar

Copyright information

© The Mathematical Programming Society 1973

Authors and Affiliations

  • Jack Edmonds
    • 1
  • Ellis L. Johnson
    • 2
  1. 1.University of WaterlooWaterlooCanada
  2. 2.IBM Watson Research CenterYorktown HeightsUSA

Personalised recommendations