Mathematical Programming

, Volume 5, Issue 1, pp 88–124

Matching, Euler tours and the Chinese postman

Authors

  • Jack Edmonds
    • University of Waterloo
  • Ellis L. Johnson
    • IBM Watson Research Center
Article

DOI: 10.1007/BF01580113

Cite this article as:
Edmonds, J. & Johnson, E.L. Mathematical Programming (1973) 5: 88. doi:10.1007/BF01580113

Abstract

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.

Download to read the full article text

Copyright information

© The Mathematical Programming Society 1973