TSP
Infrastructure for the Traveling Salesperson Problem
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) <doi:10.18637/jss.v023.i02>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.2.7 |
2026-04-09 windows/windows R-4.5 | TSP_1.2.7.zip |
768.6 KiB |