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

The convex hull of a set of points is the smallest convex set that contains the points. This paper presents a convex hull algorithm that combines the 2-d Quickhull algorithm with the general dimension.