Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback14 pages $20.00 $16.00 20% Web Discount

Given a set of [N] points and distances between all points, this paper presents an algorithm for determining an optimal partition of the points into [k] mutually exclusive and exhaustive subsets or clusters according to an objective function defined on the set of all partitions. The value of the objective function for a given partition is defined as the maximum within-cluster distance in the partition. The algorithm determines an optimal partition by solving a sequence of set-covering problems, which have no more than [N] constraints and typically less than 1.5 [N] variables. 14 pp. Ref.

This report is part of the RAND Corporation paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.