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.
9 previous versions
- TSP_1.0-6. Released over 1 year ago.
- TSP_1.0-5. Released over 1 year ago.
- TSP_1.0-4. Released over 1 year ago.
- TSP_1.0-3. Released almost 2 years ago.
- TSP_1.0-2. Released over 2 years ago.
- TSP_1.0-1. Released almost 3 years ago.
- TSP_1.0-0. Released about 4 years ago.
- TSP_0.2-4. Released almost 5 years ago.
- TSP_0.2-1. Released about 6 years ago.
Ratings
Overall: |
|
Documentation: |
|
Log in to vote.
Reviews
No one has written a review of TSP yet. Want to be the first? Write one now.
Related packages: DEoptim, LowRankQP, boot, clue, desirability, gafit, genalg, glpk, gsl, igraph, kernlab, linprog, lpSolve, minpack.lm, optmatch, quadprog, quantreg, rgenoud, sna, subplex … (20 best matches, based on common tags.)
Search for TSP on google, google scholar, r-help, r-devel.
Visit TSP on R Graphical Manual.
