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.

Package details

AuthorChris Brunsdon
MaintainerChris Brunsdon <christopher.brunsdon@nuim.ie>
LicenseGPL (>= 2)
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the tbart package in your browser

Any scripts or data that you put into this service are public.

tbart documentation built on May 2, 2019, 2:49 p.m.