Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Np-Hardness - What is NP-hard in TSP?


The travelling salesman problem (TSP) poses this question: 'Given a set of cities and the distances between each pair, what is the shortest possible route that visits each city only once and returns to the starting city?' This is a problem of NP-hardness in combinatorial optimization, which is significant in...