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.
Version: | 1.0-10 |
Depends: | R (≥ 2.14.0) |
Imports: | graphics |
Suggests: | maps, sp, maptools |
Published: | 2015-02-03 |
Author: | Michael Hahsler [aut, cre, cph], Kurt Hornik [aut, cph] |
Maintainer: | Michael Hahsler <mhahsler at lyle.smu.edu> |
License: | GPL-3 |
Copyright: | All code is Copyright (C) Michael Hahsler and Kurt Hornik. |
URL: | http://lyle.smu.edu/IDA/seriation |
NeedsCompilation: | yes |
Classification/ACM: | G.1.6, G.2.1, G.4 |
Citation: | TSP citation info |
Materials: | NEWS |
In views: | Optimization |
CRAN checks: | TSP results |
Reference manual: | TSP.pdf |
Vignettes: |
Introduction to TSP |
Package source: | TSP_1.0-10.tar.gz |
Windows binaries: | r-devel: TSP_1.0-10.zip, r-release: TSP_1.0-10.zip, r-oldrel: TSP_1.0-10.zip |
OS X Snow Leopard binaries: | r-release: TSP_1.0-10.tgz, r-oldrel: TSP_1.0-10.tgz |
OS X Mavericks binaries: | r-release: TSP_1.0-10.tgz |
Old sources: | TSP archive |
Reverse depends: | PairViz, penDvine, tspmeta |
Reverse imports: | extracat, seriation, vines |
Reverse suggests: | archetypes, VineCopula |