Personal website Rudolf Adamkovič

Home / Computer science / Traveling salesman problem (TSP)


Decision version

The decision version of the traveling salesman problem asks,

Is there a tour shorter than a given length?

Is there a solution that does not exceed a given threshold?


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