Solves Teitz and Bart's p-median problem - given a set of points attempts to find subset of size p such that summed distances of any point in the set to the nearest point in p is minimised. Although generally effective, this algorithm does not guarantee that a globally optimal subset is found.
|Depends:||Rcpp (≥ 0.10.3), sp|
|Suggests:||GISTools, RColorBrewer, rgeos|
|Maintainer:||Chris Brunsdon <christopher.brunsdon at nuim.ie>|
|License:||GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]|
|CRAN checks:||tbart results|
|Windows binaries:||r-devel: tbart_1.0.zip, r-release: tbart_1.0.zip, r-oldrel: tbart_1.0.zip|
|OS X El Capitan binaries:||r-release: tbart_1.0.tgz|
|OS X Mavericks binaries:||r-oldrel: tbart_1.0.tgz|
|Old sources:||tbart archive|
Please use the canonical form https://CRAN.R-project.org/package=tbart to link to this page.