11 citations · 37 across the 18 of their papers we have counts for
26 papers
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs
Mingyu Guo, Max Ward, Aneta Neumann +2
Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/a…
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits
Aneta Neumann, Yue Xie, Frank Neumann
Evolutionary algorithms have been widely used for a range of stochastic optimization problems in order to address complex real-world optimization problems. We consider the knapsack…
Coevolutionary Pareto Diversity Optimization
Aneta Neumann, Denis Antipov, Frank Neumann
Computing diverse sets of high quality solutions for a given optimization problem has become an important topic in recent years. In this paper, we introduce a coevolutionary Pareto…
Evolutionary Diversity Optimisation for The Traveling Thief Problem
Adel Nikfarjam, Aneta Neumann, Frank Neumann
There has been a growing interest in the evolutionary computation community to compute a diverse set of high-quality solutions for a given optimisation problem. This can provide th…
Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation
Adel Nikfarjam, Jakob Bossek, Aneta Neumann +1
Evolutionary algorithms based on edge assembly crossover (EAX) constitute some of the best performing incomplete solvers for the well-known traveling salesperson problem (TSP). Oft…
Exact Counting and Sampling of Optima for the Knapsack Problem
Jakob Bossek, Aneta Neumann, Frank Neumann
Computing sets of high quality solutions has gained increasing interest in recent years. In this paper, we investigate how to obtain sets of optimal solutions for the classical kna…