{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:49Z","timestamp":1750307689451,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T00:00:00Z","timestamp":1231459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,1,9]]},"DOI":"10.1145\/1527125.1527139","type":"proceedings-article","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T13:37:11Z","timestamp":1239802631000},"page":"103-112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Don't be greedy when calculating hypervolume contributions"],"prefix":"10.1145","author":[{"given":"Karl","family":"Bringmann","sequence":"first","affiliation":[{"name":"Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[{"name":"International Computer Science Institute, Berkeley, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,1,9]]},"reference":[{"key":"e_1_3_2_1_2_1","unstructured":"J. L. Bentley. Algorithms for Klee's rectangle problems 1977. Department of Computer Science Carnegie Mellon University Unpublished notes.  J. L. Bentley. Algorithms for Klee's rectangle problems 1977. Department of Computer Science Carnegie Mellon University Unpublished notes."},{"volume-title":"Technical University of Dortmund","year":"2007","author":"Beume N.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"e_1_3_2_1_5_1","first-page":"233","volume-title":"Proc. Second International Conference on Computational Intelligence (IASTED'06)","author":"Beume N.","year":"2006"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688518"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_40"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01020-0_6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424730"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007032"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.1.1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299401"},{"key":"e_1_3_2_1_14_1","unstructured":"J. D. Knowles. Local-Search and Hybrid Evolutionary Algorithms for Pareto Optimization. PhD thesis Department of Computer Science University of Reading UK 2002.  J. D. Knowles. Local-Search and Hybrid Evolutionary Algorithms for Pareto Optimization. PhD thesis Department of Computer Science University of Reading UK 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554838"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220065"},{"key":"e_1_3_2_1_17_1","first-page":"2225","volume-title":"Proc. IEEE Congress on Evolutionary Computation (CEC'05)","author":"While R. L.","year":"2005"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851275"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2007.20"},{"key":"e_1_3_2_1_20_1","unstructured":"E. Zitzler. Hypervolume metric calculation 2001. Computer Engineering and Networks Laboratory (TIK) ETH Zurich Switzerland ftp:\/\/ftp.tik.ee.ethz.ch\/pub\/people\/zitzler\/hypervol.c.  E. Zitzler. Hypervolume metric calculation 2001. Computer Engineering and Networks Laboratory (TIK) ETH Zurich Switzerland ftp:\/\/ftp.tik.ee.ethz.ch\/pub\/people\/zitzler\/hypervol.c."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762545.1762618"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"}],"event":{"name":"FOGA '09: Foundations of Genetic Algorithms X","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Orlando Florida USA","acronym":"FOGA '09"},"container-title":["Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1527125.1527139","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1527125.1527139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:52Z","timestamp":1750253392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1527125.1527139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,9]]},"references-count":23,"alternative-id":["10.1145\/1527125.1527139","10.1145\/1527125"],"URL":"https:\/\/doi.org\/10.1145\/1527125.1527139","relation":{},"subject":[],"published":{"date-parts":[[2009,1,9]]},"assertion":[{"value":"2009-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}