Bossek, Jakob, and Frank Neumann. “Exploring the Feature Space of TSP Instances Using Quality Diversity.”10.1145/3512290.3528851__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2022, pp. 186–194, doi:10.1145/3512290.3528851.

Heins, Jonathan, et al. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–15.

Nikfarjam, Adel, et al. “Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation.” Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–11.

Bossek, Jakob, et al. “Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.”10.1007/978-3-030-58112-1_24__Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, 2020, pp. 346–359, 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.”10.1007/978-3-319-50349-3_4__Learning and Intelligent Optimization, edited by Paola Festa et al., Springer International Publishing, 2016, pp. 48–59, 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.”10.1007/978-3-319-49130-1_1__Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, Springer-Verlag, 2016, pp. 3–12, doi:10.1007/978-3-319-49130-1_1.

Mersmann, Olaf, et al. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.”10.1007/s10472-013-9341-2__Annals of Mathematics and Artificial Intelligence, vol. 69, no. 2, 2013, pp. 151–182, doi:10.1007/s10472-013-9341-2.

Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219, Springer-Verlag, 2012, pp. 115–129.