Improved quick hypervolume algorithm

DOI10.1016/j.cor.2017.09.016zbMath1391.90553arXiv1612.03402OpenAlexW2963054067MaRDI QIDQ1652507

Andrzej Jaszkiewicz

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.03402

zbMATH Keywords

multiobjective optimizationhypervolume indicatorcomputational complexity analysis

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization ⋮ Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ Multi-Objective Evolutionary Algorithms: Past, Present, and Future ⋮ Efficient computation of expected hypervolume improvement using box decomposition algorithms ⋮ Performance indicators in multiobjective optimization

Cites Work

• Multidimensional divide-and-conquer
• On the solution of linear recurrence equations
• A box decomposition algorithm to compute the hypervolume indicator