61 citations · 570 across the 108 of their papers we have counts for
21 papers · 1 filter
Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints
Anh Viet Do, Frank Neumann
In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynam…
Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems
Aneta Neumann, Jakob Bossek, Frank Neumann
Submodular functions allow to model many real-world optimisation problems. This paper introduces approaches for computing diverse sets of high quality solutions for submodular opti…
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…
Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem
Jakob Bossek, Frank Neumann
In the area of evolutionary computation the calculation of diverse sets of high-quality solutions to a given optimization problem has gained momentum in recent years under the term…
Using Neural Networks and Diversifying Differential Evolution for Dynamic Optimisation
Maryam Hasani Shoreh, Renato Hermoza Aragonés, Frank Neumann
Dynamic optimisation occurs in a variety of real-world problems. To tackle these problems, evolutionary algorithms have been extensively used due to their effectiveness and minimum…
Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions
Jakob Bossek, Aneta Neumann, Frank Neumann
The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting componen…