Graph Theory.
https://youtu.be/87X57ldq1ok Traveling salesman problem — “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 origin city?” — Wiki → TSP is an NP-hard problem → Algorithms: Held-Karp, branch