Tag: science
-
Exact Hypervolume Subset Selection in 3-D: Implementing a Galactic Algorithm
Michael T. M. Emmerich, University of Jyväskylä, Finland, September 2026 In 2017 Karl Bringmann, Sergio Cabello and I showed that selecting the best out of points with respect to the hypervolume indicator is NP-hard already in three dimensions, that it can nevertheless be solved in time , and that it admits an efficient polynomial-time approximation…
-
Diversity Subset Selection on Lines and Staircases
My report, titled Exact Dynamic Programming for Solow–Polasky Diversity Subset Selection on Lines and Staircases, is now available on arXiv: https://arxiv.org/abs/2604.26929. In multiobjective optimization and decision analysis, we often face a deceptively simple task: from a larger set of candidate solutions, choose a smaller subset that is still representative, well-spread, and diverse. This sounds easy…
