Skip to contents

Greedy selection

Farthest-first (Gonzalez) selection and its seeding strategies.

FarFirst()
Greedy farthest-first point selection
PickPoint()
Seed to initialize farthest-first selection

Max-Min diversity problem solvers

DropAdd()
DropAdd Tabu Search for the Max-Min Diversity Problem
Grasp()
GRASP with Path Relinking for the Max-Min Diversity Problem
ExactMaxMin()
Exact Max-Min Diversity Problem solution

Max-Sum diversity problem solver

ExactMaxSum()
Exact Maximum Diversity Problem (max-sum) solution

Max-Mean dispersion problem solver

MaxMean()
Max-Mean Dispersion Problem solver

k-centre solvers

KCentre() KCenter()
Discrete k-centre solver
ExactKCentre() ExactKCenter()
Exact discrete k-centre optimum

Maximum-entropy (maxdet) selection

MaxEntropy()
Maximum-entropy (maxdet) subset selection

Scoring

MinDist()
Minimum pairwise distance within a selection
MeanDist()
Mean dispersion of a selection
KCentreRadius() KCenterRadius()
Covering radius of a set of centres

Reporting

format(<MaxMinSelection>) print(<MaxMinSelection>)
Format and print Coreset solver results
format(<KCentreSelection>) print(<KCentreSelection>) format(<KCentreExact>) print(<KCentreExact>)
Format and print k-centre solver results
format(<MaxEntropySelection>) print(<MaxEntropySelection>)
Format and print maximum-entropy (maxdet) solver results
format(<MaxMeanSelection>) print(<MaxMeanSelection>) summary(<MaxMeanSelection>)
Format and print Max-Mean solver results
format(<MaxSumSelection>) print(<MaxSumSelection>)
Format and print Max-Sum (maximum diversity) solver results
summary(<MaxMinSelection>)
Detailed summaries of Coreset solver results