2 papers
cs.NE2023
Run Time Bounds for Integer-Valued OneMax Functions
Jonathan Gadea Harder, Timo Kötzing, Xiaoyue Li +1
While most theoretical run time analyses of discrete randomized search heuristics focused on finite search spaces, we consider the search space . This is a further ge…
math.CO2022
Analysis of a Gray-Box Operator for Vertex Cover
Samuel Baguley, Tobias Friedrich, Timo Kötzing +3
Combinatorial optimization problems are a prominent application area of evolutionary algorithms, where the (1+1) EA is one of the most investigated. We extend this algorithm by int…