{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:35Z","timestamp":1759638275314,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T00:00:00Z","timestamp":1183766400000},"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":[[2007,7,7]]},"DOI":"10.1145\/1276958.1277114","type":"proceedings-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:41Z","timestamp":1197055181000},"page":"765-772","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["Do additional objectives make a problem harder?"],"prefix":"10.1145","author":[{"given":"Dimo","family":"Brockhoff","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Nils","family":"Hebbinghaus","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Christian","family":"Klein","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"given":"Eckart","family":"Zitzler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2007,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_54"},{"key":"e_1_3_2_1_2_1","volume-title":"K.-H","author":"Brockhoff D.","year":"2006","unstructured":"D. Brockhoff and E. Zitzler . Dimensionality Reduction in Multiobjective Optimization: The Minimum Objective Subset Problem . In K.-H . Waldmann and U. M. Stocker, editors, Proc. of Operations Research 2006 . Springer , 2007. to appear. D. Brockhoff and E. Zitzler. Dimensionality Reduction in Multiobjective Optimization: The Minimum Objective Subset Problem. In K.-H. Waldmann and U. M. Stocker, editors, Proc. of Operations Research 2006. Springer, 2007. to appear."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1215640"},{"key":"e_1_3_2_1_5_1","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"Deb K.","year":"2001","unstructured":"K. Deb . Multi-objective optimization using evolutionary algorithms . Wiley , Chichester, UK , 2001 . K. Deb. Multi-objective optimization using evolutionary algorithms. Wiley, Chichester, UK, 2001."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11844297_99"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_2"},{"issue":"1","key":"e_1_3_2_1_9_1","first-page":"1","volume":"3","author":"Fonseca C. M.","year":"1995","unstructured":"C. M. Fonseca and P. J. Fleming . An Overview of Evolutionary Algorithms in Multiobjective Optimization. Evol. Comp. , 3 ( 1 ): 1 -- 16 , 1995 . C. M. Fonseca and P. J. Fleming. An Overview of Evolutionary Algorithms in Multiobjective Optimization. Evol. Comp., 3(1):1--16, 1995.","journal-title":"An Overview of Evolutionary Algorithms in Multiobjective Optimization. Evol. Comp."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299908"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","volume-title":"Proc. of STACS '03","author":"Giel O.","year":"2003","unstructured":"O. Giel and I. Wegener . Evolutionary algorithms and the maximum matching problem . In Proc. of STACS '03 , vol. 2607 of LNCS , p. 415--426, 2003 . O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proc. of STACS '03, vol. 2607 of LNCS, p. 415--426, 2003."},{"key":"e_1_3_2_1_12_1","volume-title":"Handbook of Evol. Comp","author":"Horn J.","year":"1997","unstructured":"J. Horn . Multicriterion decision making . In Handbook of Evol. Comp . CRC Press , 1997 . J. Horn. Multicriterion decision making. In Handbook of Evol. Comp. CRC Press, 1997."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554684"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.974841"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049378.57591.c6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/647889.736521"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","volume-title":"Proc. of PPSN '02","author":"Laumanns M.","year":"2002","unstructured":"M. Laumanns , L. Thiele , E. Zitzler , E. Welzl , and K. Deb . Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem . In Proc. of PPSN '02 , vol. 2439 of LNCS , p. 44--53. Springer , 2002 . M. Laumanns, L. Thiele, E. Zitzler, E. Welzl, and K. Deb. Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem. In Proc. of PPSN '02, vol. 2439 of LNCS, p. 44--53. Springer, 2002."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_19_1","series-title":"LNCS","volume-title":"Proc. of PPSN '04","author":"Neumann F.","year":"2004","unstructured":"F. Neumann . Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem . In Proc. of PPSN '04 , vol. 3242 of LNCS , p. 80--89, 2004 . F. Neumann. Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. In Proc. of PPSN '04, vol. 3242 of LNCS, p. 80--89, 2004."},{"key":"e_1_3_2_1_20_1","series-title":"IEEE Press","volume-title":"of CEC '04","author":"Neumann F.","year":"2004","unstructured":"F. Neumann . Expected runtimes of evolutionary algorithms for the eulerian cycle problem. In Proc . of CEC '04 , vol. 1 of IEEE Press , p. 904--910, 2004 . F. Neumann. Expected runtimes of evolutionary algorithms for the eulerian cycle problem. In Proc. of CEC '04, vol. 1 of IEEE Press, p. 904--910, 2004."},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","volume-title":"Proc. of GECCO '04","author":"Neumann F.","year":"2004","unstructured":"F. Neumann and I. Wegener . Randomized local search, evolutionary algorithms, and the minimum spanning tree problem . In Proc. of GECCO '04 , vol. 3102 of LNCS , p. 713--724, 2004 . F. Neumann and I. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. In Proc. of GECCO '04, vol. 3102 of LNCS, p. 713--724, 2004."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9004-x"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","volume-title":"S. Obayashi et al.","author":"Wagner T.","year":"2007","unstructured":"T. Wagner , N. Beume , and B. Naujoks . Pareto-, Aggregation-, and Indicator-based Methods in Many-objective Optimization . In S. Obayashi et al. , editors, Proc. of EMO 2007 , vol. 4403 of LNCS , p. 742--756. Springer , 2007. T. Wagner, N. Beume, and B. Naujoks. Pareto-, Aggregation-, and Indicator-based Methods in Many-objective Optimization. In S. Obayashi et al., editors, Proc. of EMO 2007, vol. 4403 of LNCS, p. 742--756. Springer, 2007."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00582738"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"}],"event":{"name":"GECCO07: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"London England","acronym":"GECCO07"},"container-title":["Proceedings of the 9th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276958.1277114","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1276958.1277114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:30Z","timestamp":1750258350000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276958.1277114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,7]]},"references-count":25,"alternative-id":["10.1145\/1276958.1277114","10.1145\/1276958"],"URL":"https:\/\/doi.org\/10.1145\/1276958.1277114","relation":{},"subject":[],"published":{"date-parts":[[2007,7,7]]},"assertion":[{"value":"2007-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}