Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
- 1 March 2012
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 425, 104-116
- https://doi.org/10.1016/j.tcs.2010.09.026
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- HypE: An Algorithm for Fast Hypervolume-Based Many-Objective OptimizationEvolutionary Computation, 2011
- Approximating the volume of unions and intersections of high-dimensional geometric objectsComputational Geometry, 2010
- S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure ProblemEvolutionary Computation, 2009
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- On the hardness of approximate reasoningArtificial Intelligence, 1996
- New Upper Bounds in Klee’s Measure ProblemSIAM Journal on Computing, 1991
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?The American Mathematical Monthly, 1977
- A note on a method for generating points uniformly on n -dimensional spheresCommunications of the ACM, 1959