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.
https://anaconda.org/r_test/r-tsp/badges/version.svg
https://anaconda.org/r_test/r-tsp/badges/latest_release_date.svg
https://anaconda.org/r_test/r-tsp/badges/latest_release_relative_date.svg
https://anaconda.org/r_test/r-tsp/badges/platforms.svg
https://anaconda.org/r_test/r-tsp/badges/license.svg
https://anaconda.org/r_test/r-tsp/badges/downloads.svg