## tbart: Teitz and Bart 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: |
0.9.1 |

Depends: |
Rcpp (≥ 0.10.3), sp |

LinkingTo: |
Rcpp |

Suggests: |
GISTools, RColorBrewer |

Published: |
2014-08-16 |

Author: |
Chris Brunsdon |

Maintainer: |
Chris Brunsdon <christopher.brunsdon at nuim.ie> |

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

NeedsCompilation: |
yes |

Citation: |
NA |

Materials: |
NA |

CRAN checks: |
tbart results |

#### Downloads: