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 Concorde, the currently fastest TSP solver. Concorde itself is not included in the package and has to be obtained separately.

Version: 1.0-9
Depends: R (≥ 2.14.0)
Suggests: maps, sp, maptools
Published: 2014-07-16
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://R-Forge.R-project.org/projects/tsp/, http://lyle.smu.edu/IDA/seriation/
NeedsCompilation: yes
Classification/ACM: G.1.6, G.2.1, G.4
Materials: NEWS
In views: Optimization
CRAN checks: TSP results


Reference manual: TSP.pdf
Vignettes: Introduction to TSP
Package source: TSP_1.0-9.tar.gz
Windows binaries: r-devel: TSP_1.0-9.zip, r-release: TSP_1.0-9.zip, r-oldrel: TSP_1.0-9.zip
OS X Snow Leopard binaries: r-release: TSP_1.0-9.tgz, r-oldrel: TSP_1.0-9.tgz
OS X Mavericks binaries: r-release: TSP_1.0-9.tgz
Old sources: TSP archive

Reverse dependencies:

Reverse depends: PairViz, penDvine, tspmeta
Reverse imports: extracat, seriation, vines
Reverse suggests: archetypes, VineCopula