Biron, David, "The Traveling Salesman Problem: Deceptivley Easy to State; Notoriously Hard to Solve" (2006). Senior Honors Theses. 188.
The purpose of this thesis is to give an overview of the history of the Traveling Salesman Problem and to show how it has been an integral part of the development of the fields of Integer Programming, and Combinatorial Optimization. The thesis starts in the 1800s and progresses through current attempts on solutions of the problem. The thesis is not meant to describe in detail every attempt made, nor to describe an original solution, but to provide a high level overview of every solution attempt, and to guide the reader on what has been done, and what still can be done.