Euler Ham
Euler Ham
170
340
Bos
346
Atl
279 197
459
Den
TSP
The traveling salesman problem is NP –
complete.
Practically, this means that there is no
know polynomial-time algorithm to solve
the problem – and there is unlikely to be
one.