Alessandro Bertagnon

Enhanced Filtering Algorithms for the Euclidean Traveling Salesperson Problem and Its Variants In Constraint Logic Programming

Abstract The Traveling Salesperson Problem (TSP) is one of the best-known problems in computer science and arises in many engineering applications, such as smart vehicles and intelligent transportation systems. In the “Euclidean” case, each node is defined by its coordinates in t...