/Travelling-Salesman-Problem-in-SQL

solves the classic traveling salesman problem (TSP) using SQL without loops: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the original city?

Watchers