A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
ND-Tree-based update: a Fast Algorithm for the Dynamic Non-Dominance Problem
[article]
2017
arXiv
pre-print
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 composed of mutually non-dominated points. It uses a new ND-Tree data structure in which each node represents a subset of points contained in a hyperrectangle defined by its local approximate ideal and nadir points. By building subsets containing points located close in the objective space and using basic properties
arXiv:1603.04798v2
fatcat:yq5vtpmpo5dw5e76smrurlnw54