The document discusses the traveling salesman problem (TSP) which aims to find the shortest route for a salesman to visit each city once and return to the starting city. While computers can solve TSP problems, the time required increases enormously with the number of cities - solving a 15,000 city problem took over 20 years, and an 85,000 city problem would take over 130 computer years. Therefore, exact solutions are only efficient for small problems, as increasing the problem size significantly lengthens the computation time required.
3. Is there a route that takes you through every city and back to the start point ‘A’ for less than 520? The answer is yes. The solution is ABCGFDEA A G B F C E D 100 80 70 70 120 60 40 70 90 110 50 30
![So What Is The Problem? ,[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)