Funder
National Natural Science Foundation of China
Natural Science Foundation of Shanghai
Fundamental Research Funds for Central Universities of the Central South University
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference31 articles.
1. Arkin, E. M., Hassin, R., & Levin, R. (2006). Approximations for minimum and min–max vehicle routing problems. Journal of Algorithms, 59, 1–18.
2. Corberan, A., & Laporte, G. (2015). Arc routing: Problems, methods, and applications. Philadelphia: SIAM.
3. Christofides, N. (1973). The optimum traversal of a graph. Omega, 6, 719–732.
4. Christofides, N. (1976). Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh.
5. Dyer, M., & Frieze, A. (1985). On the complexity of partitioning graphs into connected subgraphs. Discrete Applied Mathematics, 10, 139–153.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献