activity
20162023
most citedWhat if we Increase the Number of Objectives? Theoretical and Empirical Implications for Many-objective Optimization

2 citations · 4 across the 5 of their papers we have counts for

collaborators
Showing 2016 · cs.DSShow all

1 paper · 2 filters

cs.DS2016

ND-Tree-based update: a Fast Algorithm for the Dynamic Non-Dominance Problem

Andrzej Jaszkiewicz, Thibaut Lust

In this paper we propose a new method called ND-Tree-based update (or shortly ND-Tree) for the dynamic non-dominance problem, i.e. the problem of online update of a Pareto archive…