Initial release: a tiered toolbox for the Max-Min Diversity Problem (MMDP / discrete p-dispersion), extracted from the FurthestPoint study package so that it can be depended on by CRAN packages (e.g. TreeSearch).
Gonzalez(): deterministic farthest-first selection from a distance matrix, Euclidean coordinates (points =), or an on-demand distance-column oracle (pass a column function as d, with N =) for spaces with no coordinate embedding. A seed argument chooses a peripheral seeding strategy ("diameter", "antimedoid", "medoid", "rowsum", "rownorm") with a robust "ensemble" default that keeps the best by TkScore().
DropAddTS() / DropAddTSPoints(): DropAdd tabu search (Porumbel et al. 2011), matrix and matrix-free coordinate paths.
ExactMaxMin(): exact node-packing optimum (Sayyady & Fathi 2016) via the highs MILP backend.
GraspPR(): GRASP with path relinking (Resende et al. 2010), a dense-matrix-only refinement metaheuristic that attains the highest T_k of the package’s methods on small to medium instances.