Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFriedrich, T.-
dc.contributor.authorKötzing, T.-
dc.contributor.authorLagodzinski, G.-
dc.contributor.authorNeumann, F.-
dc.contributor.authorSchirneck, M.-
dc.contributor.editorIgel, C.-
dc.contributor.editorSudholt, D.-
dc.contributor.editorWitt, C.-
dc.identifier.citationProceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA 2017), 2017 / Igel, C., Sudholt, D., Witt, C. (ed./s), pp.45-54-
dc.description.abstractLinear functions have gained a lot of attention in the area of run time analysis of evolutionary computation methods and the corresponding analyses have provided many effective tools for analyzing more complex problems. In this paper, we consider the behavior of the classical (1+1) Evolutionary Algorithm for linear functions under linear constraint. We show tight bounds in the case where both the objective and the constraint function is given by the OneMax function and present upper bounds as well as lower bounds for the general case. We also consider the LeadingOnes fitness function.-
dc.description.statementofresponsibilityTobias Friedrich, Timo Kötzing, Gregor Lagodzinski, Frank Neumann, Martin Schirneck-
dc.publisherAssociation for Computing Machinery-
dc.rights© 2017 Copyright held by the owner/author(s). Publication rights licensed to ACM.-
dc.subjectRun time analysis; evolutionary algorithm; knapsack; constraints-
dc.titleAnalysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints-
dc.typeConference paper-
dc.contributor.conferenceACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA) (12 Jan 2017 - 15 Jan 2017 : Copenhagen, Denmark)-
dc.publisher.placeNew York-
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]-
Appears in Collections:Aurora harvest 8
Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.