{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:32Z","timestamp":1759847252440},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135625"},{"type":"electronic","value":"9783319135632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13563-2_36","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:36:25Z","timestamp":1415961385000},"page":"419-430","source":"Crossref","is-referenced-by-count":2,"title":["On the Impact of Utility Functions in Interactive Evolutionary Multi-objective Optimization"],"prefix":"10.1007","author":[{"given":"Frank","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Anh Quang","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Baswana, S., Biswas, S., Doerr, B., Friedrich, T., Kurur, P.P., Neumann, F.: Computing single source shortest paths using single-objective fitness functions. In: Jansen, T., Garibay, I., Wiegand, R.P., Wu, A.S. (eds.) Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms (FOGA 2009), Orlando, USA, pp. 59\u201366. ACM Press (2009)","DOI":"10.1145\/1527125.1527134"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2012.05.036","volume":"456","author":"R. Berghammer","year":"2012","unstructured":"Berghammer, R., Friedrich, T., Neumann, F.: Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. Theor. Comput. Sci.\u00a0456, 2\u201317 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-32937-1_13","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"D. Brockhoff","year":"2012","unstructured":"Brockhoff, D., L\u00f3pez-Ib\u00e1\u00f1ez, M., Naujoks, B., Rudolph, G.: Runtime analysis of simple interactive evolutionary biobjective optimization algorithms. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012, Part I. LNCS, vol.\u00a07491, pp. 123\u2013132. Springer, Heidelberg (2012)"},{"key":"36_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5184-0","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"C.A. Coello Coello","year":"2002","unstructured":"Coello Coello, C.A., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, New York (2002)"},{"key":"36_CR5","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K. Deb","year":"2001","unstructured":"Deb, K.: Multi-objective optimization using evolutionary algorithms. Wiley, Chichester (2001)"},{"issue":"5","key":"36_CR6","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1109\/TEVC.2010.2064323","volume":"14","author":"K. Deb","year":"2010","unstructured":"Deb, K., Sinha, A., Korhonen, P.J., Wallenius, J.: An interactive evolutionary multiobjective optimization method based on progressively approximated value functions. IEEE Trans. Evolutionary Computation\u00a014(5), 723\u2013739 (2010)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-35533-2_18","volume-title":"Artificial Evolution","author":"B. Doerr","year":"2012","unstructured":"Doerr, B., Winzen, C.: Black-box complexity: Breaking the o(n logn) barrier of leadingones. In: Hao, J.-K., Legrand, P., Collet, P., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2011. LNCS, vol.\u00a07401, pp. 205\u2013216. Springer, Heidelberg (2012)"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci.\u00a0276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"36_CR9","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"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-88908-3_7","volume-title":"Multiobjective Optimization","author":"A. Jaszkiewicz","year":"2008","unstructured":"Jaszkiewicz, A., Branke, J.: Interactive multiobjective evolutionary algorithms. In: Branke, J., Deb, K., Miettinen, K., S\u0142owi\u0144ski, R. (eds.) Multiobjective Optimization. LNCS, vol.\u00a05252, pp. 179\u2013193. Springer, Heidelberg (2008)"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F. Neumann","year":"2007","unstructured":"Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci.\u00a0378(1), 32\u201340 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR12","volume-title":"Convergence properties of evolutionary algorithms","author":"G. Rudolph","year":"1997","unstructured":"Rudolph, G.: Convergence properties of evolutionary algorithms. Kova\u010d, Hamburg (1997)"},{"issue":"5","key":"36_CR13","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TEVC.2006.888929","volume":"11","author":"Y. Zhou","year":"2007","unstructured":"Zhou, Y., He, J.: A runtime analysis of evolutionary algorithms for constrained optimization problems. IEEE Trans. Evolutionary Computation\u00a011(5), 608\u2013619 (2007)","journal-title":"IEEE Trans. Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13563-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T17:18:02Z","timestamp":1559063882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13563-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135625","9783319135632"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13563-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}