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

k-centre solvers

KCentre() KCenter()
Near-optimal discrete k-centre solver
ExactKCentre() ExactKCenter()
Exact discrete k-centre optimum on small instances

Scoring

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

Reporting

format(<KCentreSelection>) print(<KCentreSelection>) format(<KCentreExact>) print(<KCentreExact>)
Format and print k-centre solver results
format(<MaxMinSelection>) print(<MaxMinSelection>)
Format and print MaxMin solver results
summary(<MaxMinSelection>)
Detailed summaries of MaxMin solver results