Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in PracticeLecture Notes in Computer Science, 2009
- Approximating the Volume of Unions and Intersections of High-Dimensional Geometric ObjectsLecture Notes in Computer Science, 2008
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003
- A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-IILecture Notes in Computer Science, 2000
- 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