New Filtering Algorithms for Euclidean TSP in Constraint Logic Programming

A new arXiv paper (2608.10881) proposes enhanced filtering algorithms for the Euclidean Traveling Salesperson Problem (TSP) and its variants, implemented in Constraint Logic Programming (CLP). The Euclidean TSP, where nodes are defined by coordinates and distances are computed using the Euclidean metric, is a classic problem in computer science with applications in smart vehicles and intelligent transportation systems. Traditional Constraint Programming (CP) approaches compute the full distance matrix and treat the problem as a general case, ignoring geometric information. The new algorithms exploit this geometric data to achieve stronger constraint propagation. The methodology is extended to other Euclidean TSP variants, including the Euclidean Generalized TSP. The paper is available on arXiv.