TSP (1.0-7)

Traveling Salesperson Problem (TSP).

http://r-forge.r-project.org/projects/tsp/
http://cran.r-project.org/web/packages/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.

Maintainer: Michael Hahsler
Author(s): Michael Hahsler and Kurt Hornik

License: GPL-2

Uses: maps, maptools, sp
Reverse depends: extracat, PairViz, penDvine, seriation, tspmeta, vines
Reverse suggests: VineCopula

Released 9 months ago.

crantastic!

Brought to you by Hadley Wickham and Bjørn Mæland. About crantastic. Like it? Hate it? Let us know at cranatic@gmail.com.
All crantastic content and data (including user contributions) are available under the CC Attribution-Share Alike 3.0 Unported license.