Electronic Resource
Springer
Mathematical programming
5 (1973), S. 88-124
ISSN:
1436-4646
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01580113
|
Location |
Call Number |
Expected |
Availability |