Matching, Euler tours and the Chinese postman-Reference-Cited by-同舟云学术

Matching, Euler tours and the Chinese postman

Published:1973-12 Issue:1 Volume:5 Page:88-124
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Edmonds Jack,Johnson Ellis L.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01580113.pdf

Reference16 articles.

1. van Aardenne-Ehrenfest and N.G. de Bruijn, “Circuits and trees in oriented graphs”,Simon Stevin 28 (1951) 203–217.

2. E.J. Beltrami and L.D. Bodin, “Networks and vehicle routing for municipal waste collection”, Report No. UPS 72-18, State University of New York, Stony Brook, N.Y. (1972).

3. C. Berge,The theory of graphs and its applications (Wiley, New York, 1962).

4. J. Edmonds, “Paths, trees and flowers”,Canadian Journal of Mathematics 17 (1965) 449–467.

5. J. Edmonds, “Maximum matching and a polyhedron with 0, 1-vertices”,Journal of Research of the National Bureau of Standards Section B, 1, 2 (1965) 125–130.

Cited by 703 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximations for the Steiner Multicycle problem;Theoretical Computer Science;2024-12

2. Maximum Profit Chinese Postman Problems Using Fuzzy Weighted Edge Length;New Mathematics and Natural Computation;2024-08-28

3. Quantum Network Routing Based on Surface Code Error Correction;2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS);2024-07-23

4. Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem;Journal of Global Optimization;2024-07-22

5. Uncertain Maximum Benefit about Chinese Postman Problem;Journal of Uncertain Systems;2024-07-06