{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:24:46Z","timestamp":1759847086473,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T00:00:00Z","timestamp":1457654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FCT \u2013 Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia","award":["EXCL\/EEI-ESS\/0257\/2012","UID\/CEC\/50021\/2013"],"award-info":[{"award-number":["EXCL\/EEI-ESS\/0257\/2012","UID\/CEC\/50021\/2013"]}]},{"name":"FCT \u2013 Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia","award":["PTDC\/EEI-ELC\/3246\/2012"],"award-info":[{"award-number":["PTDC\/EEI-ELC\/3246\/2012"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10732-016-9309-6","type":"journal-article","created":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T07:30:34Z","timestamp":1457681434000},"page":"245-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Extending quick hypervolume"],"prefix":"10.1007","volume":"22","author":[{"given":"Lu\u00eds M. S.","family":"Russo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4852-1641","authenticated-orcid":false,"given":"Alexandre P.","family":"Francisco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,11]]},"reference":[{"key":"9309_CR1","volume-title":"Design & Analysis of Computer Algorithms","author":"A Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J.: Design & Analysis of Computer Algorithms. Pearson Education India, Gurgaon (1974)"},{"key":"9309_CR2","doi-asserted-by":"crossref","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 18\u201320, 1967, Spring Joint Computer Conference, AFIPS \u201967 (Spring), pp. 483\u2013485. ACM, New York, NY, USA (1967)","DOI":"10.1145\/1465482.1465560"},{"key":"9309_CR3","volume-title":"Programming Pearls","author":"J Bentley","year":"2000","unstructured":"Bentley, J.: Programming Pearls. Addison-Wesley Professional, Reading (2000)"},{"issue":"6","key":"9309_CR4","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/TEVC.2008.919001","volume":"12","author":"L Bradstreet","year":"2008","unstructured":"Bradstreet, L., While, L., Barone, L.: A fast incremental hypervolume algorithm. IEEE Trans. Evol. Comput. 12(6), 714\u2013723 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9309_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/176454.176484","volume":"2","author":"P Briggs","year":"1993","unstructured":"Briggs, P., Torczon, L.: An efficient representation for sparse sets. ACM Lett. Progr. Lang. Syst. 2, 59\u201369 (1993)","journal-title":"ACM Lett. Progr. Lang. Syst."},{"key":"9309_CR6","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Friedrich, T.: Approximating the least hypervolume contributor: Np-hard in general, but fast in practice. In: EMO, pp. 6\u201320 (2009)","DOI":"10.1007\/978-3-642-01020-0_6"},{"issue":"3","key":"9309_CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1162\/EVCO_a_00012","volume":"18","author":"K Bringmann","year":"2010","unstructured":"Bringmann, K., Friedrich, T.: An efficient algorithm for computing hypervolume contributions. Evol. Comput. 18(3), 383\u2013402 (2010)","journal-title":"Evol. Comput."},{"key":"9309_CR8","volume-title":"Programming with POSIX Threads","author":"D Butenhof","year":"1997","unstructured":"Butenhof, D.: Programming with POSIX Threads. Addison-Wesley Professional, Reading (1997)"},{"key":"9309_CR9","series-title":"Wiley-Interscience series in systems and optimization","volume-title":"Multi-objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2009","unstructured":"Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms. Wiley-Interscience series in systems and optimization. Wiley, Chichester (2009)"},{"key":"9309_CR10","doi-asserted-by":"crossref","unstructured":"Emmerich, M., Beume, N., Naujoks, B.: An EMO algorithm using the hypervolume measure as selection criterion. In: Evolutionary Multi-criterion Optimization, LNCS, vol. 3410, pp. 62\u201376. Springer (2005)","DOI":"10.1007\/978-3-540-31880-4_5"},{"issue":"3","key":"9309_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/360680.360694","volume":"18","author":"RW Floyd","year":"1975","unstructured":"Floyd, R.W., Rivest, R.L.: Algorithm 489: The algorithm SELECT for finding the ith smallest of n elements [m1]. Commun. ACM 18(3), 173 (1975)","journal-title":"Commun. ACM"},{"key":"9309_CR12","doi-asserted-by":"crossref","unstructured":"Fonseca, C.M., Guerreiro, A.P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Paquete, L.: On the computation of the empirical attainment function. In: EMO, pp. 106\u2013120 (2011)","DOI":"10.1007\/978-3-642-19893-9_8"},{"key":"9309_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88051-6","volume-title":"Multi-objective Memetic Algorithms","author":"C Goh","year":"2009","unstructured":"Goh, C., Ong, Y., Tan, K.: Multi-objective Memetic Algorithms, vol. 171. Springer, Berlin (2009)"},{"key":"9309_CR14","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/42411.42415","volume":"31","author":"JL Gustafson","year":"1988","unstructured":"Gustafson, J.L.: Reevaluating Amdahl\u2019s law. Commun. ACM 31, 532\u2013533 (1988)","journal-title":"Commun. ACM"},{"key":"9309_CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"CAR Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 64: Quicksort. Commun. ACM 4, 321 (1961)","journal-title":"Commun. ACM"},{"issue":"7","key":"9309_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"CAR Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 65: Find. Commun. ACM 4(7), 321\u2013322 (1961)","journal-title":"Commun. ACM"},{"key":"9309_CR17","doi-asserted-by":"crossref","unstructured":"Huband, S., Hingston, P., While, L., Barone, L.: An evolution strategy with probabilistic mutation for multi-objective optimization. In: IEEE Congress on Evolutionary Computation, pp. 2284\u20132291 (2003)","DOI":"10.1109\/CEC.2003.1299373"},{"issue":"3\u20134","key":"9309_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1093\/biomet\/19.3-4.225","volume":"19","author":"JO Irwin","year":"1927","unstructured":"Irwin, J.O.: On the frequency distribution of the means of samples from a population having any law of frequency with finite moments, with special reference to pearson\u2019s type ii. Biometrika 19(3\u20134), 225\u2013239 (1927)","journal-title":"Biometrika"},{"key":"9309_CR19","doi-asserted-by":"crossref","unstructured":"Knowles, J.D., Corne, D.W., Fleischer, M.: Bounded archiving using the lebesgue measure. In: IEEE Congress on Evolutionary Computation, pp. 2490\u20132497 (2003)","DOI":"10.1109\/CEC.2003.1299401"},{"issue":"5","key":"9309_CR20","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1145\/78607.78614","volume":"33","author":"AH Karp","year":"1990","unstructured":"Karp, A.H., Flatt, H.P.: Measuring parallel processor performance. Commun. ACM 33(5), 539\u2013543 (1990)","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"9309_CR21","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.tcs.2005.06.032","volume":"347","author":"KC Kiwiel","year":"2005","unstructured":"Kiwiel, K.C.: On Floyd and Rivest\u2019s SELECT algorithm. Theor. Comput. Sci. 347(1\u20132), 214\u2013238 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9309_CR22","doi-asserted-by":"crossref","unstructured":"Overmars, M., Yap, C.K.: New upper bounds in klee\u2019s measure problem. In: 1988 29th Annual Symposium on Foundations of Computer Science, pp. 550\u2013556 (1988)","DOI":"10.1109\/SFCS.1988.21971"},{"issue":"3\u20134","key":"9309_CR23","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1093\/biomet\/19.3-4.240","volume":"19","author":"H Philip","year":"1927","unstructured":"Philip, H.: The distribution of means for samples of size n drawn from a population in which the variate takes values between 0 and 1, all such values being equally probable. Biometrika 19(3\u20134), 240\u2013244 (1927)","journal-title":"Biometrika"},{"issue":"4","key":"9309_CR24","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1109\/TEVC.2013.2281525","volume":"18","author":"LMS Russo","year":"2014","unstructured":"Russo, L.M.S., Francisco, A.P.: Quick hypervolume. IEEE Trans Evol. Comput. 18(4), 481\u2013502 (2014)","journal-title":"IEEE Trans Evol. Comput."},{"key":"9309_CR25","series-title":"P. S. Series","volume-title":"The Paradox of Choice: Why More is Less","author":"B Schwartz","year":"2005","unstructured":"Schwartz, B.: The Paradox of Choice: Why More is Less. P. S. Series. HarperCollins, New York (2005)"},{"key":"9309_CR26","doi-asserted-by":"crossref","unstructured":"Watanabe, T., Tatsukawa, T., Oyama, A.: On the fast hypervolume calculation method. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 965\u2013969 (2015). doi: 10.1109\/CEC.2015.7256994","DOI":"10.1109\/CEC.2015.7256994"},{"key":"9309_CR27","doi-asserted-by":"crossref","unstructured":"While, L., Bradstreet, L.: Applying the WFG algorithm to calculate incremental hypervolumes. In: 2012 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2012)","DOI":"10.1109\/CEC.2012.6256171"},{"key":"9309_CR28","doi-asserted-by":"crossref","unstructured":"While, L., Bradstreet, L., Barone, L.: A fast way of calculating exact hypervolumes. IEEE Trans. Evol. Comput. 16(1), 86\u201395 (2011)","DOI":"10.1109\/TEVC.2010.2077298"},{"issue":"1","key":"9309_CR29","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou, A., Qu, B., Li, H., Zhao, S., Suganthan, P., Zhang, Q.: Multiobjective evolutionary algorithms: A survey of the state-of-the-art. Swarm Evol. Comput. 1(1), 32\u201349 (2011)","journal-title":"Swarm Evol. Comput."},{"key":"9309_CR30","doi-asserted-by":"crossref","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. In: Parallel Problem Solving from Nature VIII, vol. 3242, pp. 832\u2013842 (2004)","DOI":"10.1007\/978-3-540-30217-9_84"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-016-9309-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-016-9309-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-016-9309-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T18:56:57Z","timestamp":1748804217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-016-9309-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,11]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9309"],"URL":"https:\/\/doi.org\/10.1007\/s10732-016-9309-6","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2016,3,11]]}}}