tbart (1.0)

0 users

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.

Maintainer: Chris Brunsdon
Author(s): Chris Brunsdon

License: GPL (>= 2)

Uses: Does not use any package

Released almost 5 years ago.

2 previous versions



  (0 votes)


  (0 votes)

Log in to vote.


No one has written a review of tbart yet. Want to be the first? Write one now.

Related packages:(20 best matches, based on common tags.)

Search for tbart on google, google scholar, r-help, r-devel.

Visit tbart on R Graphical Manual.