Computing Hypervolume Contributions in Low Dimensions: Asymptotically Optimal Algorithm and Complexity Results
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- HypE: An Algorithm for Fast Hypervolume-Based Many-Objective OptimizationEvolutionary Computation, 2011
- An Efficient Algorithm for Computing Hypervolume ContributionsEvolutionary Computation, 2010
- S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure ProblemEvolutionary Computation, 2009
- Covariance Matrix Adaptation for Multi-objective OptimizationEvolutionary Computation, 2007
- An EMO Algorithm Using the Hypervolume Measure as Selection CriterionLecture Notes in Computer Science, 2005
- Indicator-Based Selection in Multiobjective SearchLecture Notes in Computer Science, 2004
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003
- Multiobjective optimization using evolutionary algorithms — A comparative case studyLecture Notes in Computer Science, 1998
- New Upper Bounds in Klee’s Measure ProblemSIAM Journal on Computing, 1991
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975