Efficient computation of expected hypervolume improvement using box decomposition algorithms
Crossref DOI link: https://doi.org/10.1007/s10898-019-00798-7
Published Online: 2019-07-03
Published Print: 2019-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Yang, Kaifeng http://orcid.org/0000-0002-3353-3298
Emmerich, Michael
Deutz, André
Bäck, Thomas
Funding for this research was provided by:
Leiden University
Text and Data Mining valid from 2019-07-03
Version of Record valid from 2019-07-03
Article History
Received: 31 January 2018
Accepted: 16 June 2019
First Online: 3 July 2019