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

Depends: |
Rcpp (≥ 0.10.3), sp |

LinkingTo: |
Rcpp |

Suggests: |
GISTools, RColorBrewer |

Published: |
2013-06-19 |

Author: |
Chris Brunsdon |

Maintainer: |
Chris Brunsdon <brunsdon at liverpool.ac.uk> |

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

NeedsCompilation: |
yes |

CRAN checks: |
tbart results |

#### Downloads: