61 citations · 570 across the 108 of their papers we have counts for
9 papers · 1 filter
One-Shot Decision-Making with and without Surrogates
Jakob Bossek, Pascal Kerschke, Aneta Neumann +2
One-shot decision making is required in situations in which we can evaluate a fixed number of solution candidates but do not have any possibility for further, adaptive sampling. Su…
Optimization of Chance-Constrained Submodular Functions
Benjamin Doerr, Carola Doerr, Aneta Neumann +2
Submodular optimization plays a key role in many real-world problems. In many real-world scenarios, it is also necessary to handle uncertainty, and potentially disruptive events th…
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings
Vanja Doskoč, Tobias Friedrich, Andreas Göbel +3
We study the problem of maximizing a non-monotone submodular function under multiple knapsack constraints. We propose a simple discrete greedy algorithm to approach this problem, a…
On the Use of Diversity Mechanisms in Dynamic Constrained Continuous Optimization
Maryam Hasani-Shoreh, Frank Neumann
Population diversity plays a key role in evolutionary algorithms that enables global exploration and avoids premature convergence. This is especially more crucial in dynamic optimi…
On the Behaviour of Differential Evolution for Problems with Dynamic Linear Constraints
Maryam Hasani-Shoreh, María-Yaneli Ameca-Alducin, Wilson Blaikie +2
Evolutionary algorithms have been widely applied for solving dynamic constrained optimization problems (DCOPs) as a common area of research in evolutionary optimization. Current be…
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…