{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:59:24Z","timestamp":1769169564053,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642198922","type":"print"},{"value":"9783642198939","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19893-9_9","type":"book-chapter","created":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T13:00:35Z","timestamp":1301058035000},"page":"121-135","source":"Crossref","is-referenced-by-count":40,"title":["Computing Hypervolume Contributions in Low Dimensions: Asymptotically Optimal Algorithm and Complexity Results"],"prefix":"10.1007","author":[{"given":"Michael T. M.","family":"Emmerich","sequence":"first","affiliation":[]},{"given":"Carlos M.","family":"Fonseca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"263","volume":"146","author":"G. Adelson-Velskij","year":"1962","unstructured":"Adelson-Velskij, G., Landis, E.: An algorithm for the organization of information. Doklady Akad. Nauk SSSR\u00a0146, 263\u2013266 (1962)","journal-title":"Doklady Akad. Nauk SSSR"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bader, J., Zitzler, E.: HypE: An algorithm for fast hypervolume-based many-objective optimization. Evolutionary Computation (2010) (in press)","DOI":"10.1162\/EVCO_a_00009"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1162\/evco.2009.17.4.17402","volume":"17","author":"N. Beume","year":"2009","unstructured":"Beume, N.: S-metric calculation by considering dominated hypervolume as Klee\u2019s measure problem. Evolutionary Computation\u00a017(4), 477\u2013492 (2009)","journal-title":"Evolutionary Computation"},{"issue":"5","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TEVC.2009.2015575","volume":"13","author":"N. Beume","year":"2009","unstructured":"Beume, N., Fonseca, C.M., L\u00f3pez-Ib\u00e1\u00f1ez, M., Paquete, L., Vahrenhold, J.: On the complexity of computing the hypervolume indicator. IEEE Transact. Evolutionary Computation\u00a013(5), 1075\u20131082 (2009)","journal-title":"IEEE Transact. Evolutionary Computation"},{"key":"9_CR5","first-page":"538","volume-title":"Conf. on Evolutionary Computation","author":"L. Bradstreet","year":"2009","unstructured":"Bradstreet, L., Barone, L., While, L.: Updating exclusive hypervolume contributions cheaply. In: Conf. on Evolutionary Computation, pp. 538\u2013544. IEEE Press, Los Alamitos (2009)"},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","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 Transact. on Evolutionary Computation\u00a012(6), 714\u2013723 (2008)","journal-title":"IEEE Transact. on Evolutionary Computation"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-540-92182-0_40","volume-title":"Algorithms and Computation","author":"K. Bringmann","year":"2008","unstructured":"Bringmann, K., Friedrich, T.: Approximating the volume of unions and intersections of high-dimensional geometric objects. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 436\u2013447. Springer, Heidelberg (2008)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-642-01020-0_6","volume-title":"Evolutionary Multi-Criterion Optimization","author":"K. Bringmann","year":"2009","unstructured":"Bringmann, K., Friedrich, T.: Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. In: Ehrgott, M., Fonseca, C.M., Gandibleux, X., Hao, J.-K., Sevaux, M. (eds.) EMO 2009. LNCS, vol.\u00a05467, pp. 6\u201320. Springer, Heidelberg (2009)"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","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. Evolutionary Computation\u00a018(3), 383\u2013402 (2010)","journal-title":"Evolutionary Computation"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-31880-4_5","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M. Emmerich","year":"2005","unstructured":"Emmerich, M., Beume, N., Naujoks, B.: An EMO algorithm using the hypervolume measure as selection criterion. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol.\u00a03410, pp. 62\u201376. Springer, Heidelberg (2005)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-36970-8_37","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M. Fleischer","year":"2003","unstructured":"Fleischer, M.: The measure of pareto optima applications to multi-objective metaheuristics. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol.\u00a02632, pp. 519\u2013533. Springer, Heidelberg (2003)"},{"key":"9_CR12","first-page":"1157","volume-title":"Conf. on Evolutionary Computation","author":"C.M. Fonseca","year":"2006","unstructured":"Fonseca, C.M., Paquete, L., L\u00f3pez-Ib\u00e1\u00f1ez, M.: An improved dimension-sweep algorithm for the hypervolume indicator. In: Conf. on Evolutionary Computation, pp. 1157\u20131163. IEEE Press, Los Alamitos (2006)"},{"key":"9_CR13","first-page":"2284","volume-title":"Conf. on Evolutionary Computation","author":"S. Huband","year":"2003","unstructured":"Huband, S., Hingston, P., While, L., Barone, L.: An evolution strategy with probabilistic mutation for multi-objective optimisation. In: Conf. on Evolutionary Computation, vol.\u00a04, pp. 2284\u20132291. IEEE Press, Los Alamitos (2003)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.2007.15.1.1","volume":"15","author":"C.. Igel","year":"2007","unstructured":"Igel, C., Hansen, N., Roth, S.: Covariance matrix adaptation for multi-objective optimization. Evolutionary Computation\u00a015(1), 1\u201328 (2007)","journal-title":"Evolutionary Computation"},{"key":"9_CR15","first-page":"527","volume-title":"GECCO 2010","author":"H. Ishibuchi","year":"2010","unstructured":"Ishibuchi, H., Tsukamoto, N., Sakane, Y., Nojima, Y.: Indicator-based evolutionary algorithm with hypervolume approximation by achievement scalarizing functions. In: GECCO 2010, pp. 527\u2013534. ACM, USA (2010)"},{"key":"9_CR16","first-page":"2490","volume-title":"Conf. on Evolutionary Computation","author":"J. Knowles","year":"2003","unstructured":"Knowles, J., Corne, D., Fleischer, M.: Bounded archiving using the Lebesgue measure. In: Conf. on Evolutionary Computation, pp. 2490\u20132497. IEEE Press, Los Alamitos (2003)"},{"key":"9_CR17","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1998","unstructured":"Knuth, D.: The Art of Computer Programming, vol.\u00a03. Addison-Wesley, Reading (1998)"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H.T. Kung","year":"1975","unstructured":"Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM\u00a022(4), 469\u2013476 (1975)","journal-title":"J. ACM"},{"key":"9_CR19","first-page":"869","volume-title":"GECCO 2007","author":"S. Mostaghim","year":"2007","unstructured":"Mostaghim, S., Branke, J., Schmeck, H.: Multi-objective particle swarm optimization on computer grids. In: GECCO 2007, pp. 869\u2013875. ACM, New York (2007)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Naujoks, B., Beume, N., Emmerich, M.: Multi-objective optimisation using S-metric selection: Application to three-dimensional solution spaces, vol.\u00a02 (2005)","DOI":"10.1109\/CEC.2005.1554838"},{"issue":"6","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1137\/0220065","volume":"20","author":"M.H. Overmars","year":"1991","unstructured":"Overmars, M.H., Yap, C.K.: New upper bounds in klee\u2019s measure problem. SIAM J. Comput.\u00a020(6), 1034\u20131045 (1991)","journal-title":"SIAM J. Comput."},{"key":"9_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, Heidelberg (1985)"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"L. While","year":"2006","unstructured":"While, L., Hingston, P., Barone, L., Huband, S.: A faster algorithm for calculating hypervolume. IEEE Transact. Evolutionary Computation\u00a010(1), 29\u201338 (2006)","journal-title":"IEEE Transact. Evolutionary Computation"},{"key":"9_CR24","unstructured":"Zitzler, E.: Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. Ph.D. thesis, ETH Zurich, Switzerland (1999)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-540-30217-9_84","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"E. Zitzler","year":"2004","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 832\u2013842. Springer, Heidelberg (2004)"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"E. Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms - A comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 292\u2013301. Springer, Heidelberg (1998)"},{"issue":"2","key":"9_CR27","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E. Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Foneseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transact. on Evolutionary Computation\u00a07(2), 117\u2013132 (2003)","journal-title":"IEEE Transact. on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19893-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T17:48:58Z","timestamp":1741110538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19893-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198922","9783642198939"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19893-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}