Although the complexity of the traveling salesman problem is still unknown, for over 50 years its study has led the way to improved solution methods in many areas of mathematical optimization. We will discuss the history of the TSP and examine the role it has played in modern computational mathematics. We will also present a survey of general techniques used in the solution the TSP and other problems in discrete mathematics. |