1. The shortest path through many points
2. Probabilistic combinatorial optimization problems, Ph. D. Thesis, Technical Report No. 194, Operations Research Center, Massachusetts Institute of Technology, Cambridge (1988).
3. , and , Distribution Management, Griffin, London (1971).
4. On the value of a random minimum spanning tree problem
5. and , Computers and Intractability: A Guide to the Theory of NP-Completeness, W. F. Freeman, San Francisco (1979).