Personal website Rudolf Adamkovič

Home / Computer science / Traveling salesman problem (TSP)


Intuition

Given pair-wise distances between cities,

find the shortest tour that visits each city exactly once

and returns back to the starting point.


© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.