1. Algorithms for the On-Line Travelling Salesman1
2. Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, 1976.
3. and Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, New York, 1979.
4. and ?The traveling salesman problem,? Annotated bibliographies in combinatorial optimization, and (Editors), Wiley, New York, 1997, pp. 199-221.
5. An Analysis of Several Heuristics for the Traveling Salesman Problem