Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
type: Item
instance of: scholarly article
title: Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
zbMATH Open document ID: 1237.68085
author: Karl Bringmann
author: Tobias Friedrich
published in: Theoretical Computer Science
publication date: 2012-05-14T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6034871
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: hypervolume indicator
describes a project that uses: HypE
describes a project that uses: SPEA2
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.09.026
OpenAlex ID: W2029496228
cites work: Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
cites work: Approximating the volume of unions and intersections of high-dimensional geometric objects
cites work: Don't be greedy when calculating hypervolume contributions
cites work: Evolutionary Multi-Criterion Optimization
cites work: Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
cites work: A note on a method for generating points uniformly on n -dimensional spheres
cites work: New Upper Bounds in Klee’s Measure Problem
cites work: Q4298260
cites work: Q5287558
cites work: On the hardness of approximate reasoning
cites work: The complexity of computing the permanent
DOI: 10.1016/J.TCS.2010.09.026
description: scientific article; zbMATH DE number 6034871