Concorde TSP

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.