{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:19:06Z","timestamp":1778249946431,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540239314","type":"print"},{"value":"9783540304999","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30499-9_28","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T09:41:13Z","timestamp":1277890873000},"page":"193-198","source":"Crossref","is-referenced-by-count":0,"title":["Expected Running Time Analysis of a Multiobjective Evolutionary Algorithm on Pseudo-boolean Functions"],"prefix":"10.1007","author":[{"given":"Nilanjan","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","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"},{"issue":"2","key":"28_CR2","first-page":"167","volume":"7","author":"J. Garnier","year":"2002","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigourous Hitting Times for Binary Mutations. Evolutionary Computation\u00a07(2), 167\u2013203 (2002)","journal-title":"Evolutionary Computation"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0056845","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"S. Droste","year":"1998","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the optimization of unimodal functions with the (1 + 1) evolutionary algorithm. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 13\u201322. Springer, Heidelberg (1998)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Jagerskupper, J.: Analysis of Simple Evolutionary Algorithm for Minimization in Euclidean Spaces. In: Proceedings of the 30\n                    th\n                   International Colloquium on Automata, Languages and Programming. LNCS, vol.\u00a02719, pp. 1068\u20131079 (2003)","DOI":"10.1007\/3-540-45061-0_82"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-48481-7_17","volume-title":"Algorithms - ESA\u201999","author":"T. Jansen","year":"1999","unstructured":"Jansen, T., Wegener, I.: On the analysis of evolutionary algorithms \u2013 A proof that crossover really can help. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 184\u2013193. Springer, Heidelberg (1999)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45712-7_5","volume-title":"Parallel Problem Solving from Nature - PPSN VII","author":"M. Laumanns","year":"2002","unstructured":"Laumanns, M., Thiele, L., Zitzler, E., Welzl, E., Deb, K.: Running time analysis of multi-objective evolutionary algorithms on a simple discrete optimization problem. In: Guerv\u00f3s, J.J.M., Adamidis, P.A., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol.\u00a02439, pp. 44\u201353. Springer, Heidelberg (2002)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: Running Time Analysis of Evolutionary Algorithms on Vector-Valued Pseudo-Boolean Functions. IEEE Transactions on Evolutionary Computation (2004)","DOI":"10.1109\/TEVC.2004.823470"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30499-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:07:57Z","timestamp":1778249277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30499-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239314","9783540304999"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30499-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}