TSP: Traveling Salesperson Problem (TSP)

Basic infrastructure and some algorithms for the traveling salesperson 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: 0.2-3
Suggests: maps, sp, maptools
Date: 2008-02-03
Author: Michael Hahsler and Kurt Hornik
Maintainer: Michael Hahsler <hahsler at ai.wu-wien.ac.at>
License: GPL-2
URL: http://r-forge.r-project.org/projects/tsp/
SystemRequirements: Concorde (http://www.tsp.gatech.edu/concorde/)
In views: Optimization
CRAN checks: TSP results

Downloads:

Package source: TSP_0.2-3.tar.gz
MacOS X binary: TSP_0.2-3.tgz
Windows binary: TSP_0.2-3.zip
Reference manual: TSP.pdf
Vignettes: Introduction to TSP
Old sources: TSP archive