Nothing
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 the Concorde TSP solver and its implementation of the Chained-Lin-Kernighan heuristic. The code for Concorde itself is not included in the package and has to be obtained separately. Hahsler and Hornik (2007) <doi:10.18637/jss.v023.i02>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Michael Hahsler [aut, cre, cph] (<https://orcid.org/0000-0003-2716-1405>), Kurt Hornik [aut, cph] (<https://orcid.org/0000-0003-4198-9911>) |
| Maintainer | Michael Hahsler <mhahsler@lyle.smu.edu> |
| License | GPL-3 |
| Version | 1.2-4 |
| URL | https://github.com/mhahsler/TSP |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the TSP package in your browser
Any scripts or data that you put into this service are public.
