{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:30Z","timestamp":1759637610924},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329364"},{"type":"electronic","value":"9783642329371"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32937-1_14","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T18:49:02Z","timestamp":1345920542000},"page":"133-142","source":"Crossref","is-referenced-by-count":9,"title":["Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations"],"prefix":"10.1007","author":[{"given":"Markus","family":"Wagner","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific (2011)","DOI":"10.1142\/7438"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1145\/1967654.1967670","volume-title":"FOGA","author":"S. Cathabard","year":"2011","unstructured":"Cathabard, S., Lehre, P.K., Yao, X.: Non-uniform mutation rates for problems with unknown solution lengths. In: FOGA, pp. 173\u2013180. ACM, New York (2011)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Durrett, G., Neumann, F., O\u2019Reilly, U.-M.: Computational complexity analysis of simple genetic programing on two problems modeling isolated program semantics. In: FOGA, pp. 69\u201380. ACM (2011)","DOI":"10.1145\/1967654.1967661"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T. Friedrich","year":"2010","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Approximating covering problems by randomized search heuristics using multiobjective models. Evolutionary Computation\u00a018(4), 617\u2013633 (2010)","journal-title":"Evolutionary Computation"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1162\/EVCO_a_00013","volume":"18","author":"O. Giel","year":"2010","unstructured":"Giel, O., Lehre, P.K.: On the effect of populations in evolutionary multiobjective optimisation. Evolutionary Computation\u00a018(3), 335\u2013356 (2010)","journal-title":"Evolutionary Computation"},{"key":"14_CR6","unstructured":"K\u00f6tzing, T., Sutton, A., Neumann, F., O\u2019Reilly, U.-M.: The Max problem revisited: the importance of mutation in genetic programming. In: GECCO (to appear, 2012)"},{"key":"14_CR7","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"issue":"2","key":"14_CR8","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 Trans. Evolutionary Computation\u00a08(2), 170\u2013182 (2004)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Neumann, F.: Computational complexity analysis of multi-objective genetic programming. In: GECCO (to appear, 2012), \n                    \n                      http:\/\/arxiv.org\/abs\/1203.4881","DOI":"10.1145\/2330163.2330274"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Neumann, F., Wegener, I.: Minimum spanning trees made easier via multi-objective optimization. In: GECCO, pp. 763\u2013770. ACM Press (2005)","DOI":"10.1145\/1068009.1068139"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization \u2013 Algorithms and Their Computational Complexity. Springer (2010)","DOI":"10.1007\/978-3-642-16544-3"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"349","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, 349\u2013366 (2004)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1016\/j.ejor.2006.08.002","volume":"181","author":"P.K. Shukla","year":"2007","unstructured":"Shukla, P.K., Deb, K.: On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods. European Journal of Operational Research\u00a0181(3), 1630\u20131652 (2007)","journal-title":"European Journal of Operational Research"},{"key":"14_CR14","series-title":"LNCS","first-page":"102","volume-title":"PPSN 2012, Part I","author":"T. Urli","year":"2012","unstructured":"Urli, T., Wagner, M., Neumann, F.: Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics. In: Coello Coello, C.A., et al. (eds.) PPSN 2012, Part I. LNCS, vol.\u00a07491, pp. 102\u2013112. Springer, Heidelberg (2012)"},{"key":"14_CR15","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/0-306-48041-7_14","volume-title":"Evolutionary Optimization","author":"I. Wegener","year":"2003","unstructured":"Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Evolutionary Optimization. International Series in Operations Research and Management Science, vol.\u00a048, pp. 349\u2013369. Springer, US (2003)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN XII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32937-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:49:08Z","timestamp":1620128948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32937-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329364","9783642329371"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32937-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}