Minimum TSP: Revision history

28 April 2023

• curprev 09:0909:09, 28 April 2023‎ Admin talk contribs‎ 2,636 bytes −217‎ No edit summary

10 April 2023

• curprev 08:2208:22, 10 April 2023‎ Admin talk contribs‎ 2,853 bytes +6‎ No edit summary

15 February 2023

• curprev 14:4514:45, 15 February 2023‎ Admin talk contribs‎ 2,847 bytes −13‎ No edit summary
• curprev 14:3714:37, 15 February 2023‎ Admin talk contribs‎ 2,860 bytes −2‎ No edit summary
• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 2,862 bytes +14‎ No edit summary
• curprev 12:0212:02, 15 February 2023‎ Admin talk contribs‎ 2,848 bytes −10‎ No edit summary

• curprev 10:2210:22, 15 February 2023‎ Admin talk contribs‎ 2,858 bytes +2,858‎ Created page with "{{DISPLAYTITLE:Minimum TSP (The Traveling-Salesman Problem)}} == Description == In Minimum TSP, you are given a set $C$ of cities and distances between each distinct pair of cities. The goal is to find an ordering or tour of the cities, such that you visit each city exactly once and return to the origin city, that minimizes the length of the tour. This is the typical variation of TSP. == Related Problems == Related: Maximum TSP, Approximate TSP == Parameter..."