tbart: Teitz and Bart's p-Median Algorithm

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.

Version:	1.0
Depends:	Rcpp (≥ 0.10.3), sp
LinkingTo:	Rcpp
Suggests:	GISTools, RColorBrewer, rgeos
Published:	2015-02-13
Author:	Chris Brunsdon
Maintainer:	Chris Brunsdon <christopher.brunsdon at nuim.ie>
License:	GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation:	yes
CRAN checks:	tbart results

Documentation:

Reference manual:

tbart.pdf

Downloads:

Package source:	tbart_1.0.tar.gz
Windows binaries:	r-devel: tbart_1.0.zip, r-release: tbart_1.0.zip, r-oldrel: tbart_1.0.zip
macOS binaries:	r-release (arm64): tbart_1.0.tgz, r-oldrel (arm64): tbart_1.0.tgz, r-release (x86_64): tbart_1.0.tgz, r-oldrel (x86_64): tbart_1.0.tgz
Old sources:	tbart archive

Reverse dependencies:

Reverse imports:

changepoint.mv

Linking:

Please use the canonical form https://CRAN.R-project.org/package=tbart to link to this page.