{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:52:09Z","timestamp":1762390329216},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876991"},{"type":"electronic","value":"9783540877004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87700-4_4","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T11:50:04Z","timestamp":1221306604000},"page":"31-40","source":"Crossref","is-referenced-by-count":57,"title":["Multiobjectivization by Decomposition of Scalar Cost Functions"],"prefix":"10.1007","author":[{"given":"Julia","family":"Handl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon C.","family":"Lovell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Knowles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/1276958.1277114","volume-title":"Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation","author":"D. Brockhoff","year":"2007","unstructured":"Brockhoff, D., Friedrich, T., Hebbinghaus, N., Klein, C., Neumann, F., Zitzler, E.: Do additional objectives make a problem harder. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 765\u2013772. ACM Press, New York (2007)"},{"key":"4_CR2","first-page":"109","volume-title":"Foundations of Genetic Algorithms 2","author":"S. Forrest","year":"1993","unstructured":"Forrest, S., Mitchell, M., Whitley, L.: Relative Building-Block Fitness and the Building-Block Hypothesis. In: Foundations of Genetic Algorithms 2, pp. 109\u2013126. Morgan Kaufmann, San Mateo (1993)"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J. Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolutionary Computation\u00a07(2), 173\u2013203 (1999)","journal-title":"Evolutionary Computation"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerub","year":"1989","unstructured":"Hagerub, T., R\u00fcb, C.: A guided tour of Chernoff bounds. Information Processing Letters\u00a033, 305\u2013308 (1989)","journal-title":"Information Processing Letters"},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/S0377-2217(98)00262-8","volume":"117","author":"T. Hanne","year":"1999","unstructured":"Hanne, T.: On the convergence of multiobjective evolutionary algorithms. European Journal of Operational Research\u00a0117(3), 553\u2013564 (1999)","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"4_CR6","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1109\/4235.974841","volume":"5","author":"T. Jansen","year":"2001","unstructured":"Jansen, T., Wegener, I.: Evolutionary algorithms \u2014 how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation\u00a05(6), 589\u2013599 (2001)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/B:JMMA.0000049378.57591.c6","volume":"3","author":"M.T. Jensen","year":"2004","unstructured":"Jensen, M.T.: Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation. Journal of Mathematical Modelling and Algorithms\u00a03(4), 323\u2013347 (2004)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"4_CR8","first-page":"430","volume-title":"Advances in Neural Information Processing Systems 8","author":"A. Juels","year":"1995","unstructured":"Juels, A., Wattenberg, M.: Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms. In: Touretzky, D.S. (ed.) Advances in Neural Information Processing Systems 8, pp. 430\u2013436. MIT Press, Cambridge (1995)"},{"key":"4_CR9","unstructured":"Knowles, J.: Local-search and hybrid evolutionary algorithms for Pareto optimization. PhD thesis, University of Reading, UK (2002)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-44719-9_19","volume-title":"Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization","author":"J. Knowles","year":"2001","unstructured":"Knowles, J., Watson, R., Corne, D.: Reducing local optima in single-objective problems by multi-objectivization. In: Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization, pp. 269\u2013283. Springer, Berlin (2001)"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"J.D. Knowles","year":"2000","unstructured":"Knowles, J.D., Corne, D.W.: Approximating the nondominated front using the Pareto archived evolution strategy. Evolutionary Computation\u00a08(2), 149\u2013172 (2000)","journal-title":"Evolutionary Computation"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11047-006-9004-x","volume":"5","author":"F. Neumann","year":"2006","unstructured":"Neumann, F., Wegener, I.: Minimum spanning trees made easier via multi-objective optimization. Natural Computing\u00a05(3), 305\u2013319 (2006)","journal-title":"Natural Computing"},{"key":"4_CR13","series-title":"LNCS","first-page":"82","volume-title":"PPSN X","author":"P.S. Oliveto","year":"2008","unstructured":"Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. In: Rudolph, G., et al. (eds.) PPSN X 2008. LNCS, vol.\u00a05199, pp. 82\u201391. Springer, Berlin (2008)"},{"issue":"4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1023\/B:JMMA.0000049379.14872.f5","volume":"3","author":"J. Scharnow","year":"2004","unstructured":"Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms\u00a03(4), 346\u2013366 (2004)","journal-title":"Journal of Mathematical Modelling and Algorithms"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN X"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87700-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T09:37:33Z","timestamp":1551605853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87700-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876991","9783540877004"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87700-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}