Concorde TSP1.8.0 - App Store

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.

Version History 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! 1.8.0 08/14/2020 Create and share solution images as vector graphic PDF files. 1.7.1 06/20/2020 Now explore optimal 3D traveling salesman tours with augmented reality and build your own tours with a TSP challenge. 1.7 02/05/2018 A cutting-plane module and tutorial are now included in the app. To run the tutorial, tap the Tutorial button at the top right on the Cutting Planes screen. 1.6 05/09/2016 Animations of perfect matching and spanning tree algorithms. Now you can pause animations and enter a step-by-step mode to see the progress of the solution methods for TSP cutting planes, tour heuristics, spanning trees, Held-Karp 1-trees, and Edmonds' blossom algorithm. 1.5 05/18/2015 Can now compute and display shortest tours on maps, using geometric, walking, or driving distances. New user interface with context-sensitive information/settings pages. 1.4 08/30/2014 Users can now input their own TSP instances, tapping city locations on the screen or entering city coordinates. 1.3.1 08/06/2014 Added nearest neighbor, farthest insertion, Christofides, 2-opt, Lin-Kernighan, and other tour-finding algorithms. Also optimal b-matchings, Delaunay triangulations, and an on-the-fly adjustment of the optimal tour as a city is moved from one location to another. 1.3 11/30/2012 Bosch-Kaplan-style TSP Art. Snap a photo and generate a TSP tour to create a continuous-line drawing of the image! 1.2 04/30/2012 Now visualize the linear-programming bound with a drawing of control zones and moats. 1.1 03/27/2012 1.0 02/04/2012