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.
https://anaconda.org/r/r-tbart/badges/version.svg
https://anaconda.org/r/r-tbart/badges/latest_release_date.svg
https://anaconda.org/r/r-tbart/badges/latest_release_relative_date.svg
https://anaconda.org/r/r-tbart/badges/platforms.svg
https://anaconda.org/r/r-tbart/badges/license.svg
https://anaconda.org/r/r-tbart/badges/downloads.svg