Author:
Jiang Hua,Kang Lishan,Zhang Shuqi,Zhu Fei
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Kuan, M.-g.: Graphic programming using odd or even points. Chinese Mathematics, 237–277 (1962)
2. Papadimitriou, C.H.: On the Complexity of Edge Traversing. Journal of the ACM (JACM) archive 23(3), 544–554 (1976)
3. Fredericson, G.N., Hecht, M.S., Kim, C.E.: Approximation Algorithms for some Routing Problems. SIAM Journal of Computing, 178–193 (1978)
4. Corberan, A., Marti, R., Scnchis, J.M.: A GRASP heuristic for the mixed Chinese Postman Problem. European Journal of Operational Research 142, 70–80 (2002)
5. Holland, J.H.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. The MIT Press, Cambridge (1975)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Ant colony optimization for Chinese postman problem;Neural Computing and Applications;2023-11-25
2. A time-dependent hierarchical Chinese postman problem;Central European Journal of Operations Research;2018-12-13
3. Chinese Postman Problems;Discrete Mathematics and Its Applications;2013-11-26