Skip to content
Sections
>> Trisquel >> Balíky >> nabia >> gnu-r >> r-cran-tsp
nabia  ] [  aramo  ]
[ Zdroj: r-cran-tsp  ]

Balík: r-cran-tsp (1.1-9-1)

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.

Ostatné balíky súvisiace s balíkom r-cran-tsp

  • závisí
  • odporúča
  • navrhuje
  • dep: libc6 (>= 2.4)
    GNU C Library: Shared libraries
    tiež virtuálny balík poskytovaný balíkom libc6-udeb
  • dep: r-api-3.5
    virtuálny balík poskytovaný balíkom r-base-core
  • dep: r-base-core (>= 3.6.2.20200221-1)
    GNU R core of statistical computation and graphics system
  • dep: r-cran-foreach
    GNU R foreach looping support
  • sug: r-cran-maps
    GNU R support for producing geographic maps
  • sug: r-cran-maptools
    GNU R Tools for reading and handling spatial objects
  • sug: r-cran-sp
    GNU R classes and methods for spatial data

Stiahnuť r-cran-tsp

Stiahnuť pre všetky dostupné architektúry
Architektúra Veľkosť balíka Nainštalovaná veľkosť Súbory
amd64 762.7 kB1126 kB [zoznam súborov]
armhf 762.6 kB1117 kB [zoznam súborov]