RT @gabrielpeyre
The Travelling salesman problem is one of the most well known NP-hard problem. Concorde’s solver can be used to solve exactly or approximately even large instances. http://www.math.uwaterloo.ca/tsp/index.html