Skip to main content

Browse the archive

https://github.com/cran/TSP
06 April 2023, 22:43:51 UTC
Revision 6043c885bb65eedf0f968ff1aebb2b3f829e0e85 authored by Michael Hahsler on 26 May 2011, 00:00:00 UTC, committed by Gabor Csardi on 26 May 2011, 00:00:00 UTC 
version 1.0-3
1 parent 8531604
Raw File
Tip revision: 6043c885bb65eedf0f968ff1aebb2b3f829e0e85 authored by Michael Hahsler on 26 May 2011, 00:00:00 UTC
version 1.0-3
Tip revision: 6043c88
DESCRIPTION 
Package: TSP
Type: Package
Title: Traveling Salesperson Problem (TSP)
Version: 1.0-3
Date: 2011-05-26
Author: Michael Hahsler and Kurt Hornik
Maintainer: Michael Hahsler <michael@hahsler.net>
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
        Concorde, the currently fastest TSP solver. Concorde itself is
        not included in the package and has to be obtained separately.
Classification/ACM: G.1.6, G.2.1, G.4
URL: http://r-forge.r-project.org/projects/tsp/
Depends: R (>= 2.10.0)
Suggests: maps, sp, maptools
License: GPL-2
Copyright: All code is Copyright (C) Michael Hahsler and Kurt Hornik.
Packaged: 2011-05-26 15:18:17 UTC; hahsler
Repository: CRAN
Date/Publication: 2011-05-26 21:16:44
back to top