Skip to Content

TSP

Traveling Salesperson Problem (TSP)
Michael Hahsler and Kurt Hornik
GPL-2
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 Concorde, the currently fastest TSP solver. Concorde itself is not included in the package and has to be obtained separately.
Versions
Package Version Released
TSP 1.0-6 12 weeks 1 day ago
TSP 1.0-5 14 weeks 6 days ago
TSP 1.0-4 25 weeks 16 hours ago
TSP 1.0-3 38 weeks 5 days ago
TSP 1.0-2 1 year 5 weeks ago
TSP 1.0-1 1 year 29 weeks ago
TSP 1.0-0
TSP 0.2-4
TSP 0.2-1
0
Your rating: None
0
Your rating: None