Rudy’s OBTF Rudolf Adamkovič

Home / Computer science


Traveling salesman problem (TSP)

The computational problem of finding

the minimum-weight Hamiltonian cycle 1

in a weighted graph.


Footnotes:

1

Called a tour.


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