Operation Research, Optimization Algorithms, Scheduler, Discrete Mathematics, Data Science.
follow to visit a set of locations and go back to the origin, at a minimum cost (e.g., time, distance). Probably the most famous NP-hard problem in combinatorial optimization. This is the basis for more complex problems like the (Capacitated) Vehicle Routing, daily bread for logistics companies