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.


News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("tbart")

1.0 by Chris Brunsdon, 4 years ago


Browse source code at https://github.com/cran/tbart


Authors: Chris Brunsdon


Documentation:   PDF Manual  


GPL (>= 2) license


Depends on Rcpp, sp

Suggests GISTools, RColorBrewer, rgeos

Linking to Rcpp


Imported by changepoint.mv.


See at CRAN