Revision 0d290c9a1999f0df37e1c7c59856653999f319a6 authored by Michael Hahsler on 01 July 2015, 01:39:53 UTC, committed by cran-robot on 01 July 2015, 01:39:53 UTC
1 parent 37adfa7
Raw File
DESCRIPTION
Package: TSP
Type: Package
Title: Traveling Salesperson Problem (TSP)
Version: 1.1-2
Date: 2015-7-30
Authors@R: c(
	person("Michael", "Hahsler", role = c("aut", "cre", "cph"),
	    email = "mhahsler@lyle.smu.edu"),
	person("Kurt", "Hornik", role = c("aut", "cph")))
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. Concorde
    itself is not included in the package and has to be obtained separately
    from http://www.math.uwaterloo.ca/tsp/concorde.html.
Classification/ACM: G.1.6, G.2.1, G.4
URL: http://lyle.smu.edu/IDA/seriation
BugReports: http://r-forge.r-project.org/projects/tsp/
Depends: R (>= 2.14.0)
Imports: graphics, foreach, utils, methods, stats, grDevices
Suggests: maps, sp, maptools, testthat
License: GPL-3
Copyright: All code is Copyright (C) Michael Hahsler and Kurt Hornik.
NeedsCompilation: yes
Packaged: 2015-06-30 20:57:27 UTC; hahsler
Author: Michael Hahsler [aut, cre, cph],
  Kurt Hornik [aut, cph]
Maintainer: Michael Hahsler <mhahsler@lyle.smu.edu>
Repository: CRAN
Date/Publication: 2015-07-01 01:39:53
back to top