@inproceedings{59ec8fb9d087462fa8abe028f25e8500,
title = "A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT",
abstract = "We investigate the MAX-2-SAT problem and study evolutionary algorithms by parameterized runtime analysis. The parameterized runtime analysis of evolutionary algorithms has been initiated recently and reveals new insights into which type of instances of NP-hard combinatorial optimization problems are hard to solve by evolutionary computing methods. We show that a variant of the (1+1) EA is a fixed-parameter evolutionary algorithm with respect to the standard parameterization for MAX-2-SAT. Furthermore, we study how the dependencies between the variables affect problem difficulty and present fixed-parameter evolutionary algorithms for the MAX-(2,3)-SAT problem where the studied parameter is the diameter of the variable graph.",
keywords = "combinatorial optimization, maxsat, runtime analysis, theory",
author = "Sutton, {Andrew M.} and Jareth Day and Frank Neumann",
year = "2012",
doi = "10.1145/2330163.2330225",
language = "English (US)",
isbn = "9781450311779",
series = "GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation",
pages = "433--440",
booktitle = "GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation",
note = "14th International Conference on Genetic and Evolutionary Computation, GECCO'12 ; Conference date: 07-07-2012 Through 11-07-2012",
}