TSP
Traveling Salesperson Problem (TSP)
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. Hahsler and Hornik (2007)
- Version1.2-4
- R version≥ 3.5.0
- LicenseGPL-3
- Needs compilation?Yes
- TSP citation info
- Last release04/04/2023
Documentation
Team
Michael Hahsler
Kurt Hornik
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends1 package
- Imports5 packages
- Suggests3 packages
- Reverse Depends4 packages
- Reverse Imports12 packages
- Reverse Suggests6 packages