3 papers
cs.LG2026
A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum +1
Anticlustering is an NP-hard combinatorial optimization problem that consists of partitioning a set of objects into equal-sized groups called anticlusters such that the objects in…
cs.LG2026
Fast and effective algorithms for fair clustering at scale
Claudio Mantuano, Manuel Kammermann, Philipp Baumann
Clustering is an unsupervised machine learning task that consists of identifying groups of similar objects. It has numerous applications and is increasingly used in fairness-sensit…
math.OC2025
A Fast and Effective Breakpoints Heuristic Algorithm for the Quadratic Knapsack Problem
Dorit S. Hochbaum, Philipp Baumann, Olivier Goldschmidt +1
The Quadratic Knapsack Problem (QKP) involves selecting a subset of elements that maximizes the sum of pairwise and singleton utilities without exceeding a given budget. The pairwi…