Mathematical Programming

, Volume 5, Issue 1, pp 88–124

Matching, Euler tours and the Chinese postman

  • Jack Edmonds
  • Ellis L. Johnson
Article

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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