A new algorithm for the directed chinese postman problem
References (8)
- et al.
Networks and vehicle routing for municipal waste collection
Networks
(1974) The Chinese Postman Problem for mixed networks
Mgmt Sci.
(1979)Optimization Algorithms for Networks and Graphs
(1978)- et al.
Matching, Euler tours and the Chinese Postman
Math. Progr.
(1973)
There are more references available in the full text version of this article.
Cited by (23)
Support-Free-Material Path Generation for DED Processes from Facetized Data
2023, Procedia CIRPTime-constrained Chinese postman problems
2002, Computers and Mathematics with ApplicationsChapter 5 Arc routing methods and applications
1995, Handbooks in Operations Research and Management ScienceSolvable cases of the k-person Chinese postman problem
1994, Operations Research LettersA Fleet Management System of Autonomous Electric Street Sweepers
2023, Proceedings of the 2023 IEEE International Conference on Cybernetics and Intelligent Systems and IEEE Conference on Robotics, Automation and Mechatronics, CIS-RAM 2023Minimum cost Eulerian cycles in road networks
2022, Iberian Conference on Information Systems and Technologies, CISTI
- ∗
Yaxiong Lin, currently the Ph.D. student in the Department of Industrial & Management Systems Engineering, Arizona State University, received his B.S. in 1983 and M.S. in 1986 from the Department of Systems Engineering, Shanghai Institute of Mechanical Engineering, Shanghai, China. Research interests include: graph theory, networks, mathematical programming, modeling and simulation. This work was done when he was at Shanghai Institute of Mechanical Engineering.
- †
Yongchang Zhao, professor of the Systems Engineering Research Institute, Shanghai Institute of Mechanical Engineering. Research interests include: graph theory, networks, mathematical programming, circuits & systems, signal flow graph and its applications, transportation planning.
Copyright © 1988 Published by Elsevier Ltd.