Source: r-cran-tsp
Standards-Version: 4.7.4
Maintainer: Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net>
Uploaders:
 Andreas Tille <tille@debian.org>,
Section: gnu-r
Testsuite: autopkgtest-pkg-r
Build-Depends:
 debhelper-compat (= 13),
 dh-r,
 r-base-dev,
 r-cran-foreach,
 architecture-is-64-bit,
 architecture-is-little-endian,
Vcs-Browser: https://salsa.debian.org/r-pkg-team/r-cran-tsp
Vcs-Git: https://salsa.debian.org/r-pkg-team/r-cran-tsp.git
Homepage: https://cran.r-project.org/package=TSP
Rules-Requires-Root: no

Package: r-cran-tsp
Architecture: any
Depends:
 ${R:Depends},
 ${shlibs:Depends},
 ${misc:Depends},
Recommends:
 ${R:Recommends},
Suggests:
 ${R:Suggests},
Description: Infrastructure for the Traveling Salesperson Problem
 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>.