The Travelling Salesperson Problem (TSP) is a classic combinatorial optimisation problem in which a salesperson must visit n cities, exactly once each, and return to the starting city while minimising ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.