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.

85 Publications


2021 | Conference Paper | LibreCat-ID: 48860
Bossek J, Neumann F. Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’21. Association for Computing Machinery; 2021:198–206. doi:10.1145/3449639.3459363
LibreCat | DOI
 

2021 | Book Chapter | LibreCat-ID: 48862
Bossek J, Sudholt D. Do Additional Optima Speed up Evolutionary Algorithms? In: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. Association for Computing Machinery; 2021:1–11.
LibreCat
 

2021 | Book Chapter | LibreCat-ID: 48881
Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. On the Potential of Normalized TSP Features for Automated Algorithm Selection. In: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. Association for Computing Machinery; 2021:1–15.
LibreCat
 

2021 | Conference Paper | LibreCat-ID: 48876
Bossek J, Wagner M. Generating Instances with Performance Differences for More than Just Two Algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO’21. Association for Computing Machinery; 2021:1423–1432. doi:10.1145/3449726.3463165
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 48893
Nikfarjam A, Bossek J, Neumann A, Neumann F. Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO’21. Association for Computing Machinery; 2021:600–608. doi:10.1145/3449639.3459384
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 48891
Neumann A, Bossek J, Neumann F. Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO’21. Association for Computing Machinery; 2021:261–269. doi:10.1145/3449639.3459385
LibreCat | DOI
 

2021 | Book Chapter | LibreCat-ID: 48892
Nikfarjam A, Bossek J, Neumann A, Neumann F. Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation. In: Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms. Association for Computing Machinery; 2021:1–11.
LibreCat
 

2021 | Journal Article | LibreCat-ID: 48854
Bossek J, Neumann F, Peng P, Sudholt D. Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica. 2021;83(10):3148–3179. doi:10.1007/s00453-021-00838-3
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 46313
Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. On the Potential of Normalized TSP Features for Automated Algorithm Selection. In: Computing Machinery Association for, ed. Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA XVI). Association for Computing Machinery; 2021:1–15. doi:10.1145/3450218.3477308
LibreCat | DOI
 

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: 48849
Bossek J, Doerr C, Kerschke P, Neumann A, Neumann F. Evolving Sampling Strategies for One-Shot Optimization Tasks. In: Parallel Problem Solving from Nature (PPSN XVI). Springer-Verlag; 2020:111–124. doi:10.1007/978-3-030-58112-1_8
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: 48844
Bossek J, Kerschke P, Trautmann H. Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. In: 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE Press; 2020:1–8. doi:10.1109/CEC48606.2020.9185613
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: 48852
Bossek J, Neumann A, Neumann F. Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. In: Parallel Problem Solving from Nature (PPSN XVI). Springer-Verlag; 2020:346–359. doi:10.1007/978-3-030-58112-1_24
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 48846
Bossek J, Grimme C, Rudolph G, Trautmann H. Towards Decision Support in Dynamic Bi-Objective Vehicle Routing. In: 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE Press; 2020:1–8. doi:10.1109/CEC48606.2020.9185778
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
 

2020 | Conference Paper | LibreCat-ID: 48897
Seiler M, Pohl J, Bossek J, Kerschke P, Trautmann H. Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. In: Parallel Problem Solving from {Nature} (PPSN XVI). Springer-Verlag; 2020:48–64. doi:10.1007/978-3-030-58112-1_4
LibreCat | DOI
 

Filters and Search Terms

(person=102979)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed