{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:41Z","timestamp":1725518441275},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_67","type":"book-chapter","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T07:50:04Z","timestamp":1221292204000},"page":"671-680","source":"Crossref","is-referenced-by-count":0,"title":["Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[]},{"given":"Christian","family":"Horoba","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"67_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel Problem Solving from Nature-PPSN VI","author":"K. Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN VI 2000. LNCS, vol.\u00a01917, pp. 849\u2013858. Springer, Heidelberg (2000)"},{"key":"67_CR2","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. Theoretical Computer Science\u00a0276, 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"key":"67_CR3","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/1276958.1277118","volume-title":"Proceedings of Conference on Genetic and Evolutionary Computation (GECCO)","author":"T. Friedrich","year":"2007","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. In: Proceedings of Conference on Genetic and Evolutionary Computation (GECCO), vol.\u00a01, pp. 797\u2013804. ACM Press, New York (2007)"},{"key":"67_CR4","first-page":"2622","volume-title":"Proceedings of Congress on Evolutionary Computation (CEC)","author":"T. Friedrich","year":"2007","unstructured":"Friedrich, T., Hebbinghaus, N., Neumann, F.: Plateaus can be harder in multi-objective optimization. In: Proceedings of Congress on Evolutionary Computation (CEC), pp. 2622\u20132629. IEEE Press, Los Alamitos (2007)"},{"key":"67_CR5","first-page":"1918","volume-title":"Proceedings of Congress on Evolutionary Computation (CEC)","author":"O. Giel","year":"2003","unstructured":"Giel, O.: Expected runtimes of a simple multi-objective evolutionary algorithm. In: Proceedings of Congress on Evolutionary Computation (CEC), pp. 1918\u20131925. IEEE Press, Los Alamitos (2003)"},{"issue":"6","key":"67_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 - 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":"2","key":"67_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/TEVC.2004.823470","volume":"8","author":"M. Laumanns","year":"2004","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: Running time analysis of multiobjective evolutionary algorithms on pseudo-boolean functions. IEEE Transactions on Evolutionary Computation\u00a08(2), 170\u2013182 (2004)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"67_CR8","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.ejor.2006.08.005","volume":"181","author":"F. Neumann","year":"2007","unstructured":"Neumann, F.: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. European Journal of Operational Research\u00a0181(3), 1620\u20131629 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"67_CR9","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":"67_CR10","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. In: Proc. of EUROGEN 2001, pp. 95\u2013100. International Center for Numerical Methods in Engineering (CIMNE) (2002)"}],"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_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T04:59:45Z","timestamp":1551589185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87700-4_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876991","9783540877004"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87700-4_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}