A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
DGX agentarXiv:2601.06351v2 Announce Type: replace Abstract: Anticlustering is an NP-hard combinatorial optimization problem that consists of partitioning a set of objects into equal-sized groups called anticl