Master of Science
William A. Smith
The traveling salesman problem is a generalized form of the simple problem of finding the shortest closed loop that connects several points in a plane. This thesis covers a basic combinatorial approach to the problem.
Wilser, Fred A., "A computational procedure for solving traveling-salesman problems" (1964). Theses and Dissertations. 3285.