Don't be greedy when calculating hypervolume contributions
From MaRDI portal
Publication:5276068
DOI10.1145/1527125.1527139zbMath1369.68299OpenAlexW1986507441MaRDI QIDQ5276068
Karl Bringmann, Tobias Friedrich
Publication date: 14 July 2017
Published in: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1527125.1527139
Analysis of algorithms and problem complexity (68Q25) Multi-objective and goal programming (90C29) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice ⋮ Illustration of fairness in evolutionary multi-objective optimization ⋮ An adaptation reference-point-based multiobjective evolutionary algorithm ⋮ Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization ⋮ On multiobjective selection for multimodal optimization
This page was built for publication: Don't be greedy when calculating hypervolume contributions
