Rudy’s OBTF Rudolf Adamkovič

Home / Computer science / Traveling salesman problem (TSP)

Complexity

The optimization and decision versions of the traveling salesman problem are

NP-hard and NP-complete

respectively.

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