# The Conundrum of the Traveling Salesman

A classic problem in computational mathematics is known as the Traveling Salesman Problem (TSP). Suppose a traveling salesman wishes to visit a predetermined N number of cities. Each city is represented as a vertex of a given graph and each two vertices are joined by an edge. The traveling salesman must find the most efficient, cost-limiting […]

Read more "The Conundrum of the Traveling Salesman"