Travelling Salesman Problem

The Travelling Salesman Problem (TSP) is a classic problem in computer science. It is a problem that is NP-complete, which means that it is a problem that is hard to solve. It is also a problem that is used to test the efficiency of algorithms.

Visit the following resources to learn more:

• Travelling Salesman Problem | Set 1 (Naive and Dynamic Programming)
• What is the Traveling Salesman Problem?
• 4.7 Traveling Salesperson Problem - Dynamic Programming
• Traveling Salesman Problem | Dynamic Programming | Graph Theory