Matching, Euler tours and the Chinese postman

Mathematical Programming

Volumn 5, Issue 1, 1973, Pages 88-124

  Edmonds, Jack ^a   Johnson, Ellis L ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002293349     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01580113     Document Type: Article

References (16)

1. Circuits and trees in oriented graphs
2. Paths, trees and flowers
3. Maximum matching and a polyhedron with 0, 1-vertices
4. The Chinese postman problem
5. Matching: a well-solved class of integer linear programs
6. Solutio problematis ad geometriam situs pertinentis
7. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
8. Revised matrix algorithms for shortest paths in a network
9. Graphic programming using odd or even points