On the mixed Chinese postman problem
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[2] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[3] Christos H. Papadimitriou,et al. On the complexity of edge traversing , 1976, J. ACM.
[4] Zaw Win,et al. Contributions to routing problems , 1987 .
[5] C. S. Orloff. A fundamental problem in vehicle routing , 1974, Networks.
[6] Gary J. Koehler,et al. The mixed postman problem , 1979, Discret. Appl. Math..
[7] Greg N. Frederickson,et al. Approximation Algorithms for Some Postman Problems , 1979, JACM.