61 citations · 570 across the 108 of their papers we have counts for
16 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…
Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple Reclaimers
Hirad Assimi, Ben Koch, Chris Garcia +2
Stockpiles are essential in the mining value chain, assisting in maximising value and production. Quality control of taken minerals from the stockpiles is a major concern for stock…
Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems
Hirad Assimi, Frank Neumann, Markus Wagner +1
Topology optimisation of trusses can be formulated as a combinatorial and multi-modal problem in which locating distinct optimal designs allows practitioners to choose the best des…
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…
Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1,2)-Minimum Spanning Tree Problem
Feng Shi, Frank Neumann, Jianxin Wang
The Minimum Spanning Tree problem (abbr. MSTP) is a well-known combinatorial optimization problem that has been extensively studied by the researchers in the field of evolutionary…
Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables
Frank Neumann, Carsten Witt
Chance constrained optimization problems allow to model problems where constraints involving stochastic components should only be violated with a small probability. Evolutionary al…