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.

AuthorChris Brunsdon
Date of publication2015-02-13 20:23:02
MaintainerChris Brunsdon <christopher.brunsdon@nuim.ie>
LicenseGPL (>= 2)
Version1.0

View on CRAN

Files in this package

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.