For this reason, greedy algorithms tend to produce sub-optimal solutions especially for larger problems.
In our approach, we use Concorde the TSP solver to find the globally optimal solution for the TSP equivalent of our clustering problem.