NP-HARD
§10 Travelling Salesman Problem (TSP)
The classic NP-hard problem is known as the travelling salesman problem (TSP). The
NIST website
provides a good definition of this problem
