Fetching the paper…
Reading the bibliography…
The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems.
The Vehicle Routing Problem
Nicos Christofides · 1976
Earlier work this paper cites.
TSPLIB – A Traveling Salesman Problem Library
Gerhard Reinelt · 1991
Earlier work this paper cites.
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and Other Geometric Problems
Sanjeev Arora · 1998
Earlier work this paper cites.
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
Joseph S. B. Mitchell · 1999
Earlier work this paper cites.
Stochastic Local Search: Foundations and Applications
Holger H. Hoos and Thomas Stützle · 2004
Earlier work this paper cites.
The Traveling Salesman Problem: A Computational Study
David L. Applegate, Robert E. Bixby, Vasek Chvátal, and William J. Cook · 2007
Earlier work this paper cites.
General k-opt submoves for the Lin-Kernighan TSP heuristic
Keld Helsgaun · 2009
Earlier work this paper cites.
In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation
William J. Cook · 2012
Earlier work this paper cites.
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
Yuichi Nagata and Shigenobu Kobayashi · 2013
Cited alongside, same era.
A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek, and Frank Neumann · 2013
Cited alongside, same era.
Automatically Improving the Anytime Behaviour of Optimisation Algorithms
Manuel López-Ibáñez, Manuel and Thomas Stützle · 2014
Cited alongside, same era.
Algorithm Runtime Prediction: Methods & Evaluation
Frank Hutter, Lin Xu, Holger H. Hoos, and Kevin Leyton-Brown · 2015
Cited alongside, same era.
Improving the state of the art in inexact tsp solving using per-instance algorithm selection
Lars Kotthoff, Pascal Kerschke, Holger Hoos, and Heike Trautmann · 2015
Cited alongside, same era.
ASlib: A Benchmark Library for Algorithm Selection
Bernd Bischl, Pascal Kerschke, Lars Kotthoff, Marius Lindauer, Yuri Malitsky, Alexandre Fréchette, Holger H. Hoos, Frank Hutter, Kevin Leyton-Brown, Kevin Tierney, and Joaquin Vanschoren · 2016
Later among the works it cites.
Building a Better Heuristic for the Traveling Salesman Problem: Combining Edge Assembly Crossover and Partition Crossover
Danilo Sanches, L. Darrell Whitley, and Renato Tinós · 2017
Later among the works it cites.
Leveraging TSP Solver Complementarity through Machine Learning
Pascal Kerschke, Lars Kotthoff, Jakob Bossek, Holger H. Hoos, and Heike Trautmann · 2018
Later among the works it cites.
Automated Algorithm Selection: Survey and Perspectives
Pascal Kerschke, Holger H. Hoos, Frank Neumann, and Heike Trautmann · 2019
Later among the works it cites.
Rigorous Performance Analysis of State-of-the-Art TSP Heuristic Solvers
Paul McMenemy, Nadarajen Veerapen, Jason Adair, and Gabriela Ochoa · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle
Stephan Meisel, Christian Grimme, Jakob Bossek, Martin Wölck, Günter Rudolph, and Heike Trautmann · 2015
Cited alongside, same era.
COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Setting
Nikolaus Hansen, Anne Auger, Olaf Mersmann, Tea Tušar, and Dimo Brockhoff · 2016
Cited alongside, same era.
Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators
Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, and Heike Trautmann · 2019
Later among the works it cites.
A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms
Jakob Bossek, Pascal Kerschke, and Heike Trautmann · 2020
Closest in time.