Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Chris Brunsdon |
| Maintainer | Chris Brunsdon <christopher.brunsdon@nuim.ie> |
| License | GPL (>= 2) |
| Version | 1.0 |
| Package repository | View 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.
