Search


Current filters:

Start a new search
Add filters:

Use filters to refine the search results.


Results 11-20 of 20 (Search time: 0.002 seconds).
Item hits:
PreviewIssue DateTitleAuthor(s)
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)
2022Co-evolutionary Diversity Optimisation for the Traveling Thief ProblemNikfarjam, A.; Neumann, A.; Bossek, J.; Neumann, F.; Rudolph, G.; Kononova, A.V.; Aguirre, H.E.; Kerschke, P.; Ochoa, G.; Tusar, T.; International Conference on Parallel Problem Solving from Nature (PPSN) (10 Sep 2022 - 14 Sep 2022 : Dortmund, Germany)
2023On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson ProblemBossek, J.; Neumann, A.; Neumann, F.; Paquete, L.; Genetic and Evolutionary Computation Conference (GECCO) (15 Jul 2023 - 15 Jul 2023 : Lisbon, Portugal)
2020Evolving Sampling Strategies for One-Shot Optimization TasksBossek, J.; Doerr, C.; Kerschke, P.; Neumann, A.; Neumann, F.; Bäck, T.; Preuss, M.; Deutz, A.H.; Wang, H.; Doerr, C.; Emmerich, M.T.M.; Trautmann, H.; 16th International Conference on Parallel Problem Solving from Nature (PPSN) (5 Sep 2020 - 9 Sep 2020 : Leiden, The Netherlands)
2021Time complexity analysis of randomized search heuristics for the dynamic graph coloring problemBossek, J.; Neumann, F.; Peng, P.; Sudholt, D.
2019Runtime analysis of randomized search heuristics for dynamic graph coloringBossek, J.; Neumann, F.; Peng, P.; Sudholt, D.; LopezIbanez, M.; Genetic and Evolutionary Computation Conference (GECCO) (13 Jul 2019 - 17 Jul 2019 : Prague, Czech Republic)
2019On the benefits of biased edge-exchange mutation for the multi-criteria spanning tree problemBossek, J.; Grimme, C.; Neumann, F.; LopezIbanez, M.; Genetic and Evolutionary Computation Conference (GECCO) (13 Jul 2019 - 17 Oct 2019 : Prague, Czech Republic)
2019Evolving diverse TSP instances by means of novel and creative mutation operatorsBossek, J.; Kerschke, P.; Neumann, A.; Wagner, M.; Neumann, F.; Trautmann, H.; Friedrich, T.; Doerr, C.; Arnold, D.V.; Foundations of Genetic Algorithms (FOGA) (26 Aug 2019 - 29 Aug 2019 : Potsdam, Germany)
2013A novel feature-based approach to characterize algorithm performance for the traveling salesperson problemMersmann, O.; Bischl, B.; Trautmann, H.; Wagner, M.; Bossek, J.; Neumann, F.
2012Local search and the traveling salesman problem: A feature-based characterization of problem hardnessMersmann, O.; Bischl, B.; Bossek, J.; Trautmann, H.; Wagner, M.; Neumann, F.; Hamadi, Y.; Schoenauer, M.; International Conference on Learning and Intelligent Optimization (6th : 2012 : Paris, France)