Author:
Baldacci Roberto,Boschetti Marco A.,Maniezzo Vittorio,Zamboni Marco
Publisher
Kluwer Academic Publishers
Reference27 articles.
1. Arkin, E.M., M.M. Halldorsson and R. Hassin (1993) "Approximating the Tree and Tour Covers of a Graph," Information Processing Letters, 47:275–282.
2. Arkin, E.M. and R. Hassin (1994) "Approximation Algorithms for the Geometric Covering Salesman Problem," Discrete Appl. Math., 55:197–218.
3. Balas, E. (1989) "The Prize Collecting Traveling Salesman Problem," Networks, 19:621–636.
4. Balas, E. and A. Ho (1980) "Set Covering Algorithms Using Cutting Planes, Heuristic, and Subgradient Optimisation: A Computational Study," Mathematical Programming Study, 12:37–60.
5. Baldacci, R. (1999) "Algorithms for Location and Routing Problems in Distribution Systems," Ph.D. Thesis, Management Science Dept., Imperial College, London.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献