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.
copied from cf-post-staging / r-tsp| Label | Latest Version |
|---|---|
| main | 1.2.6 |
| cf201901 | 1.1_5 |
| cf202003 | 1.1_5 |
| gcc7 | 1.1_6 |
