Author:
Hamaguchi Shin-ya,Katoh Naoki
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. K. Altinkemer and B. Gavish, Heuristics for delivery problems with constant error guarantees, Transportation Science, 24 1990, 294–297.
2. T. Asano, N. Katoh, H. Tamaki and T. Tokuyama, Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k, Proc. of 29th Annual ACM Symposium on Theory of Computing, pp. 275–283, 1997.
3. I. Averbakh and O. Berman, Sales-delivery man problems on treelike networks, Networks, 25 1995, 45–58.
4. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, 1976.
5. N. Christofides, A. Mingozzi and P. Toth. The vehicle routing problem. in: N. Christofides, A. Mingozzi, P. Toth and C. Sandi, editors. Combinatorial Optimization. John Wiley & Sons Ltd, London, 1979.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献