1. Adelaide Research & Scholarship

Search


Current filters:


Start a new search
Add filters:

Use filters to refine the search results.

 | 
Results 1-7 of 7 (Search time: 0.001 seconds).
  • previous
  • 1
  • next
Item hits:
PreviewIssue DateTitleAuthor(s)
2021Evolutionary Diversity Optimization and the Minimum Spanning Tree ProblemBossek, J.; Neumann, F.; Genetic and Evolutionary Computation Conference (GECCO) (10 Jul 2021 - 14 Jul 2021 : Lille, France)
2021Generating Instances with Performance Differences for More Than Just Two AlgorithmsBossek, J.; Wagner, M.; Genetic and Evolutionary Computation Conference (GECCO) (10 Jul 2021 - 14 Jul 2021 : Lille, France)
2021Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity OptimisationNikfarjam, A.; Bossek, J.; Neumann, A.; Neumann, F.; Finck, S.; Hellwig, M.; Oliveto, P.S.; Foundations of Genetic Algorithms (FOGA) (6 Sep 2021 - 8 Sep 2021 : virtual online)
2021Entropy-based evolutionary diversity optimisation for the traveling salesperson problemNikfarjam, A.; Bossek, J.; Neumann, A.; Neumann, F.; Chicano, F.; Krawiec, K.; GECCO '21: Genetic and Evolutionary Computation Conference (10 Jul 2021 - 14 Jul 2021 : Lille, France)
2021Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithmsBossek, J.; Neumann, A.; Neumann, F.; Chicano, F.; Krawiec, K.; Genetic and Evolutionary Computation Conference (GECCO) (10 Jul 2021 - 14 Jul 2021 : virtual online)
2021Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functionsNeumann, A.; Bossek, J.; Neumann, F.; Chicano, F.; Krawiec, K.; Genetic and Evolutionary Computation Conference (GECCO) (10 Jul 2021 - 14 Jul 2021 : virtual online)
2021Time complexity analysis of randomized search heuristics for the dynamic graph coloring problemBossek, J.; Neumann, F.; Peng, P.; Sudholt, D.

Discover