The Traveling Salesman Problem (TSP), a quintessential challenge in computational theory, involves finding the shortest route that visits each city exactly once before returning to the starting point.

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...