61 citations · 242 across the 48 of their papers we have counts for
11 papers · 1 filter
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs
Mingyu Guo, Jialiang Li, Aneta Neumann +2
Active Directory is the default security management system for Windows domain networks. We study the shortest path edge interdiction problem for defending Active Directory style at…
On the Use of Quality Diversity Algorithms for The Traveling Thief Problem
Adel Nikfarjam, Aneta Neumann, Frank Neumann
In real-world optimisation, it is common to face several sub-problems interacting and forming the main problem. There is an inter-dependency between the sub-problems, making it imp…
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…
Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem
Adel Nikfarjam, Jakob Bossek, Aneta Neumann +1
Computing diverse sets of high-quality solutions has gained increasing attention among the evolutionary computation community in recent years. It allows practitioners to choose fro…
Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms
Jakob Bossek, Aneta Neumann, Frank Neumann
In practise, it is often desirable to provide the decision-maker with a rich set of diverse solutions of decent quality instead of just a single solution. In this paper we study ev…
Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems
Yue Xie, Aneta Neumann, Frank Neumann
The Stockpile blending problem is an important component of mine production scheduling, where stockpiles are used to store and blend raw material. The goal of blending material fro…
Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights
Yue Xie, Aneta Neumann, Frank Neumann +1
Addressing a complex real-world optimization problem is a challenging task. The chance-constrained knapsack problem with correlated uniform weights plays an important role in the c…
Heuristic Strategies for Solving Complex Interacting Stockpile Blending Problem with Chance Constraints
Yue Xie, Aneta Neumann, Frank Neumann
Heuristic algorithms have shown a good ability to solve a variety of optimization problems. Stockpile blending problem as an important component of the mine scheduling problem is a…
Advanced Ore Mine Optimisation under Uncertainty Using Evolution
William Reid, Aneta Neumann, Simon Ratcliffe +1
In this paper, we investigate the impact of uncertainty in advanced ore mine optimisation. We consider Maptek's software system Evolution which optimizes extraction sequences based…
Analysis of Evolutionary Diversity Optimisation for Permutation Problems
Anh Viet Do, Mingyu Guo, Aneta Neumann +1
Generating diverse populations of high quality solutions has gained interest as a promising extension to the traditional optimization tasks. This work contributes to this line of r…