Generalized offline orthant search
Maxim Buzdalov · Proceedings of the Genetic and Evolutionary Computation Conference · 2018
We introduce generalized offline orthant search, an algorithmic framework that can be used to solve many problems coming from evolutionary multiobjective optimization using a common well-optimized algorithmic core and relatively cheap reduction procedures. The complexity of the core procedure is O(n · (log n)k-1) for n points of dimension k, and it has a good performance in practice.