Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
6 Publications
2020 | Conference Paper | LibreCat-ID: 48847
Bossek J, Neumann F, Peng P, Sudholt D. More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:1277–1285. doi:10.1145/3377930.3390174
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48851
Bossek J, Casel K, Kerschke P, Neumann F. The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:1286–1294. doi:10.1145/3377930.3390243
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48845
Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple Vehicles. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:166–174. doi:10.1145/3377930.3390146
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48850
Bossek J, Doerr C, Kerschke P. Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’20. Association for Computing Machinery; 2020:778–786. doi:10.1145/3377930.3390155
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48879
Do AV, Bossek J, Neumann A, Neumann F. Evolving Diverse Sets of Tours for the Travelling Salesperson Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO’20. Association for Computing Machinery; 2020:681–689. doi:10.1145/3377930.3389844
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 48895
Roostapour V, Bossek J, Neumann F. Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference. {GECCO} ’20. Association for Computing Machinery; 2020:551–559. doi:10.1145/3377930.3390168
LibreCat
| DOI