## 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> |

BugReports: |
NA |

License: |
GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |

URL: |
NA |

NeedsCompilation: |
yes |

CRAN checks: |
tbart results |

#### Downloads: