- Article
In the Close Enough Traveling Salesman Problem (CETSP), one must find the shortest tour that travels through every given customer-centered neighborhood, which is usually a disk centered on each customer or target. This problem has applications in var...