Matching, Euler tours and the Chinese postman

@article{Edmonds1973MatchingET,
  title={Matching, Euler tours and the Chinese postman},
  author={J. Edmonds and E. Johnson},
  journal={Mathematical Programming},
  year={1973},
  volume={5},
  pages={88-124}
}
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. 
The mixed postman problem
Linear programming relaxations of the mixed postman problem
Approximation algorithms for the asymmetric postman problem
A cutting plane algorithm for the General Routing Problem
A cutting plane algorithm for the windy postman problem
A primal algorithm for optimum matching
Approximation Algorithms for the Mixed Postman Problem
On the optimality of a simple strategy for searching graphs
  • S. Gal
  • Mathematics, Computer Science
  • Int. J. Game Theory
  • 2001
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 18 REFERENCES
Paths, Trees, and Flowers
Flows in Networks.
Routing and scheduling a fleet of vehicles to/from central facilities -the school bus problem
  • Routing and scheduling a fleet of vehicles to/from central facilities -the school bus problem
  • 1972
Graphentheorie in Planungs- und Tourenproblemen
Revised Matrix Algorithms for Shortest Paths
Paths
  • trees and flowers", Canadian Journal o f Mathematics 17
  • 1965
...
1
2
...