28 citations · 32 across the 5 of their papers we have counts for
5 papers · 1 filter
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint
Frank Neumann, Mojgan Pourhassan, Carsten Witt
In the last decade remarkable progress has been made in development of suitable proof techniques for analysing randomised search heuristics. The theoretical investigation of these…
Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem
Vahid Roostapour, Mojgan Pourhassan, Frank Neumann
The performance of base-line Evolutionary Algorithms (EAs) on combinatorial problems has been studied rigorously. From the theoretical viewpoint, the literature extensively investi…
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments
Vahid Roostapour, Mojgan Pourhassan, Frank Neumann
Many real-world optimization problems occur in environments that change dynamically or involve stochastic components. Evolutionary algorithms and other bio-inspired algorithms have…
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem
Mojgan Pourhassan, Feng Shi, Frank Neumann
A rigorous runtime analysis of evolutionary multi-objective optimization for the classical vertex cover problem in the context of parameterized complexity analysis has been present…
A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms
Dogan Corus, Per Kristian Lehre, Frank Neumann +1
Bi-level optimisation problems have gained increasing interest in the field of combinatorial optimisation in recent years. With this paper, we start the runtime analysis of evoluti…