Given a list of cities and the distance to travel between each pair of them, the traveling salesman problem, or TSP for short, asks for the shortest route to visit each city and to return to the starting point. The Concorde App computes exact optimal solutions for TSP, based on the Concorde code by Applegate, Bixby, Chvatal, and Cook. Instances of 1,000 or more cities can often be solved exactly, with all computations carried out locally on your iPhone or iPad. The app is a companion to the book "In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation", William Cook, Princeton University Press, 2012.
Includes Exact TSP Solver, 3D Points, TSP Art, Map Routing, Tour-Finding Heuristics, Cutting Planes , TSP Challenge, Minimum Spanning Tree, and Perfect Matching modules.
Show less
What's New in Concorde TSP
1.8.0
August 14, 2020
You can now read problem files stored locally or in the cloud. Support was added for landscape mode on the iPhone and iPad. And, best of all, the TSP App is now available in the Mac Store!
I think that this will be an excellet tool for demonstrating what the Traveling Salesman Problem is.
I find, though, that the menu is very hard to read because of the color palette used; I can hardly see the menu selections. Would be great if there was a way to make them show up better regardless of the color palette chosen by the system.