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-7 |
| Depends: | R (≥ 2.10.0) |
| Suggests: | maps, sp, maptools |
| Published: | 2012-08-22 |
| Author: | Michael Hahsler and Kurt Hornik |
| Maintainer: | Michael Hahsler <mhahsler at lyle.smu.edu> |
| License: | GPL-2 (see file LICENSE) |
| Copyright: | All code is Copyright (C) Michael Hahsler and Kurt Hornik. |
| URL: | http://r-forge.r-project.org/projects/tsp/ |
| NeedsCompilation: | yes |
| Classification/ACM: | G.1.6, G.2.1, G.4 |
| Citation: | TSP citation info |
| In views: | Optimization |
| CRAN checks: | TSP results |
| Package source: | TSP_1.0-7.tar.gz |
| MacOS X binary: | TSP_1.0-7.tgz |
| Windows binary: | TSP_1.0-7.zip |
| Reference manual: | TSP.pdf |
| Vignettes: |
Introduction to TSP |
| Old sources: | TSP archive |
| Reverse depends: | extracat, PairViz, penDvine, seriation, tspmeta, vines |
| Reverse suggests: | VineCopula |