activity
20202024
most citedThe Hypervolume Indicator: Problems and Algorithms

283 citations · 297 across the 9 of their papers we have counts for

collaborators

9 papers

cs.CG2024

Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem

François Clément, Carola Doerr, Kathrin Klamroth +1

Low discrepancy point sets have been widely used as a tool to approximate continuous objects by discrete ones in numerical processes, for example in numerical integration. Followin…

cs.DM2024★ 1 cited

Ensuring connectedness for the Maximum Quasi-clique and Densest -subgraph problems

Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1

Given an undirected graph , a quasi-clique is a subgraph of whose density is at least . Two optimization problems can be defined for quasi-cliques: the Ma…

cs.DM2024★ 2 cited

Solving the Multiobjective Quasi-Clique Problem

Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1

Given a simple undirected graph , a quasi-clique is a subgraph of whose density is at least . Finding a maximum quasi-clique has been addressed from two d…

cs.CG2023★ 1 cited

Constructing Optimal Star Discrepancy Sets

François Clément, Carola Doerr, Kathrin Klamroth +1

The star discrepancy is a very well-studied measure used to quantify the uniformity of a point set distribution. Constructing optimal point sets for this measure is se…

cs.NE2023★ 5 cited

Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms

François Clément, Diederick Vermetten, Jacob de Nobel +3

The star discrepancy is a measure for the regularity of a finite set of points taken from . Low discrepancy point sets are highly relevant for Quasi-Monte Car…

cs.CG2023★ 2 cited

Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection

François Clément, Carola Doerr, Luís Paquete

Building upon the exact methods presented in our earlier work [J. Complexity, 2022], we introduce a heuristic approach for the star discrepancy subset selection problem. The heuris…

cs.AI2021★ 3 cited

Reproducibility in Evolutionary Computation

Manuel López-Ibáñez, Juergen Branke, Luís Paquete

Experimental studies are prevalent in Evolutionary Computation (EC), and concerns about the reproducibility and replicability of such studies have increased in recent times, reflec…

cs.CG2021

Star Discrepancy Subset Selection: Problem Formulation and Efficient Approaches for Low Dimensions

François Clèment, Carola Doerr, Luís Paquete

Motivated by applications in instance selection, we introduce the star discrepancy subset selection problem, which consists of finding a subset of m out of n points that minimizes…

cs.DS2020★ 283 cited

The Hypervolume Indicator: Problems and Algorithms

Andreia P. Guerreiro, Carlos M. Fonseca, Luís Paquete

The hypervolume indicator is one of the most used set-quality indicators for the assessment of stochastic multiobjective optimizers, as well as for selection in evolutionary multio…