Bossek, Jakob, and Frank Neumann. “Exploring the Feature Space of TSP Instances Using Quality Diversity.”https://doi.org/10.1145/3512290.3528851__In Proceedings of the Genetic and Evolutionary Computation Conference, 186–194. GECCO ’22. New York, NY, USA: Association for Computing Machinery, 2022.https://doi.org/10.1145/3512290.3528851 .
LibreCat: /record/48861
DOI: 10.1145/3512290.3528851

Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” In Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 1–15. New York, NY, USA: Association for Computing Machinery, 2021.
LibreCat: /record/48881

Nikfarjam, Adel, Jakob Bossek, Aneta Neumann, and Frank Neumann. “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, 1–11. New York, NY, USA: Association for Computing Machinery, 2021.
LibreCat: /record/48892

Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.”https://doi.org/10.1007/978-3-030-58112-1_24__In Parallel Problem Solving from Nature (PPSN XVI), 346–359. Berlin, Heidelberg: Springer-Verlag, 2020.https://doi.org/10.1007/978-3-030-58112-1_24 .
LibreCat: /record/48852
DOI: 10.1007/978-3-030-58112-1_24

Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.”https://doi.org/10.1007/978-3-319-50349-3_4__In Learning and Intelligent Optimization, edited by Paola Festa, Meinolf Sellmann, and Joaquin Vanschoren, 48–59. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-50349-3_4 .
LibreCat: /record/48873
DOI: 10.1007/978-3-319-50349-3_4

Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.”https://doi.org/10.1007/978-3-319-49130-1_1__In Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, 3–12. AI*IA 2016. Berlin, Heidelberg: Springer-Verlag, 2016.https://doi.org/10.1007/978-3-319-49130-1_1 .
LibreCat: /record/48874
DOI: 10.1007/978-3-319-49130-1_1

Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek, and Frank Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.”https://doi.org/10.1007/s10472-013-9341-2__Annals of Mathematics and Artificial Intelligence 69, no. 2 (2013): 151–182.https://doi.org/10.1007/s10472-013-9341-2 .
LibreCat: /record/48889
DOI: 10.1007/s10472-013-9341-2

Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” In Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219, 115–129. LION 6. Berlin, Heidelberg: Springer-Verlag, 2012.
LibreCat: /record/48890