Description Details Author(s) References

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: | tbart |

Type: | Package |

Version: | 1.0 |

Date: | 2015-02-12 |

License: | GPL (>= 2) |

Maintainer: | Chris Brunsdon mailto:christopher.brunsdon@nuim.ie |

Chris Brunsdon

Teitz, M. B., and P. Bart (1968), Heuristic methods for estimating generalized vertex median of a weighted graph, Operations Research, 16, 955-961.

tbart documentation built on May 30, 2017, 6:16 a.m.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.