Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Bringmann, K. & Friedrich, T. Theoretical Computer Science, 425:104--116, March 30, 2012.
bibtex   
@ARTICLE{Bringmann12,
  author = {Karl Bringmann and Tobias Friedrich},
  title = {{Approximating the least hypervolume contributor: NP-hard in general, but fast in practice}},
  journal = {Theoretical Computer Science},
  volume = {425},
  pages = {104--116},
  month = {March 30},
  year = {2012}
}

Downloads: 0