Paket: r-cran-tsp (1.2-4-1) [debports]

[ Källkod:  ]

GNU R traveling salesperson problem (TSP)

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.

Andra paket besläktade med r-cran-tsp

• dep: libc6 (>= 2.16)

  GNU C-bibliotek: Delade bibliotek
  också ett virtuellt paket som tillhandahålls av libc6-udeb

• dep: r-api-4.0

  virtuellt paket som tillhandahålls av r-base-core

• dep: r-base-core (>= 4.3.1-1)

  GNU R core of statistical computation and graphics system

• dep: r-cran-foreach

  GNU R foreach looping support

• rec: r-cran-testthat

  GNU R testsuite

• sug: r-cran-doparallel

  GNU R foreach parallel adaptor for the parallel package

• sug: r-cran-maps

  GNU R support for producing geographic maps

Hämta r-cran-tsp

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
x32 (inofficiell anpassning)	610,9 kbyte	806,0 kbyte	[filförteckning]