For the ambitious, some of the leading code for solving the TSP to optimality is... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		pyk on Sept 4, 2013 \| parent \| context \| favorite \| on: Show HN: Find the fastest route via a place For the ambitious, some of the leading code for solving the TSP to optimality is Concorde (at best it has optimally solved an 85,900 "city" instance): http://www.math.uwaterloo.ca/tsp/concorde/downloads/download... or solve/run Concorde on Argonne National Laboratory's server here: http://neos.mcs.anl.gov/neos/solvers/co:concorde/TSP.html Disclaimer: free for academic use

jffry on Sept 4, 2013 [–]

Ah, cool. So I guess I was wrong that a 5k-city solution was infeasible.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact