Shortest Tour through Large Cities in Selected Countries
Initializing live version

Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
The maps show the shortest tours through cities in a number of selected countries with 30 or more large cities. This is based on Mathematica computations seeking solutions of the classic traveling salesman problem.
Contributed by: Peter Cullen Burbery (August 27)
Open content licensed under CC BY-NC-SA
Details
Snapshots
Permanent Citation