Publication Details
Title: Approximating the Least Hypervolume Contributor : NP-Hard in General, but Fast in Practice
Author: K. Bringmann and T. Friedrich
Group: Algorithms
Date: April 2009
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/approximatingthe09.pdf
Acknowledgements:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through a postdoctoral fellowship.
Bibliographic Information:
Proceedings of the Fifth International Conference on Evolutionary Multi-Criterion Optimization (EMO 2009), Nantes, France, pp. 6-20
Bibliographic Reference:
K. Bringmann and T. Friedrich. Approximating the Least Hypervolume Contributor : NP-Hard in General, but Fast in Practice. Proceedings of the Fifth International Conference on Evolutionary Multi-Criterion Optimization (EMO 2009), Nantes, France, pp. 6-20, April 2009
Author: K. Bringmann and T. Friedrich
Group: Algorithms
Date: April 2009
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/approximatingthe09.pdf
Acknowledgements:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through a postdoctoral fellowship.
Bibliographic Information:
Proceedings of the Fifth International Conference on Evolutionary Multi-Criterion Optimization (EMO 2009), Nantes, France, pp. 6-20
Bibliographic Reference:
K. Bringmann and T. Friedrich. Approximating the Least Hypervolume Contributor : NP-Hard in General, but Fast in Practice. Proceedings of the Fifth International Conference on Evolutionary Multi-Criterion Optimization (EMO 2009), Nantes, France, pp. 6-20, April 2009