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 ${\mathbb{Z}}^n$. This is a further ge…