Have fun with the traveling salesman problem!

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.

Ratings and Reviews

5.0 out of 5
1 Rating

1 Rating ,

Amazing and Fun

This is really a lot of fun to play around. My only problem is the "Germany 120" data set. 22 years after the reunion it still has only cities from West Germany!?! Seriously? Could you not find better data or is this a political statement? Maybe you should add a set of only Confederate States of America?

Ozzy the Dog ,

Nice but needs save option!

Would be 5 stars if I could save images!

skuz73 ,

UI bugged

Didn’t seem to work... user interface bugged

App Privacy

The developer, William Cook, has not provided details about its privacy practices and handling of data to Apple. For more information, see the developer’s privacy policy.

No Details Provided

The developer will be required to provide privacy details when they submit their next app update.


  • Family Sharing

    With Family Sharing set up, up to six family members can use this app.

You May Also Like