/
DESCRIPTION
32 lines (32 loc) · 1.19 KB
/
DESCRIPTION
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
Package: TSP
Type: Package
Title: Traveling Salesperson Problem (TSP)
Version: 1.2-4.1
Date: 2023-xx-xx
Authors@R:
c(person("Michael", "Hahsler",
role = c("aut", "cre", "cph"),
email = "mhahsler@lyle.smu.edu",
comment = c(ORCID = "0000-0003-2716-1405")),
person("Kurt", "Hornik",
role = c("aut", "cph"),
comment = c(ORCID = "0000-0003-4198-9911"))
)
Description: 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>.
Classification/ACM: G.1.6, G.2.1, G.4
URL: https://github.com/mhahsler/TSP
BugReports: https://github.com/mhahsler/TSP/issues
Depends: R (>= 3.5.0)
Imports: graphics, foreach, utils, stats, grDevices
Suggests: maps, doParallel, testthat
Encoding: UTF-8
RoxygenNote: 7.3.1
Roxygen: list(markdown = TRUE)
License: GPL-3
Copyright: All code is Copyright (C) Michael Hahsler and Kurt Hornik.