Teitz and Bart's p-median problem with Spatial* and Spatial*DataFrame objects

Description

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.

Details

Package: tbart
Type: Package
Version: 1.0
Date: 2015-02-12
License: GPL (>= 2)
Maintainer: Chris Brunsdon mailto:christopher.brunsdon@nuim.ie

Author(s)

Chris Brunsdon

References

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