TSP (0.2-1)

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.

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

License: GPL

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

Released almost 13 years ago.