About Anaconda Help Download Anaconda
If you were automatically logged out you may need to refresh the page. You're trying to access a page that requires authentication. ×

Basic infrastructure and some algorithms for the traveling salesperson problem (also traveling salesman problem; TSP). The package provides some simple algorithms and an interface to the Concorde TSP solver and its implementation of the Chained-Lin-Kernighan heuristic. The code for Concorde itself is not included in the package and has to be obtained separately.

Label Latest Version
main 1.1_7

© 2026 Anaconda, Inc. All Rights Reserved. (v4.2.14) Legal | Privacy Policy