The traveling salesman problem (TSP) asks the question, "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to ...
Understand how a nearest-neighbour (greedy) heuristic builds a TSP tour. Visualise the produced tour and compute its total length. Compare greedy performance to a simple 2‑opt local improvement.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results