Travelling Salesman Problem

Home > Computer Science > Algorithms and data structures > Graph Traversal > Travelling Salesman Problem

A classic optimization problem that involves finding the shortest possible route that visits a set of nodes (cities) and returns to the starting node (city).