3 citations · 3 across the 2 of their papers we have counts for
5 papers
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…
Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem
Mojgan Pourhassan, Vahid Roostapour, Frank Neumann
In this paper, we perform theoretical analyses on the behaviour of an evolutionary algorithm and a randomised search algorithm for the dynamic vertex cover problem based on its dua…
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…