Showing papers by "Éric D. Taillard published in 2019"

TL;DR: The main goal of this article is to present how to build a list of good candidate edges with a complexity lower than quadratic in the context of TSP instances given by a general function.