We present an algorithm for incremental non-dominated sorting, a procedure to use with steady-state multiobjective algorithms, with the complexity of O(N(log N)M−2) for a single insertion, where N is the number of points and M is the number of objectives. This result generalizes the previously known O(N) algorithm designed for two objectives.
Our… (More)