activity
20122026
most citedParameterized Runtime Analyses of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem

5 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing cs.AIShow all

1 paper · 1 filter

cs.AI2024

Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem

Duc-Cuong Dang, Aneta Neumann, Frank Neumann +2

Quality diversity (QD) algorithms have shown to provide sets of high quality solutions for challenging problems in robotics, games, and combinatorial optimisation. So far, theoreti…