[network analysis, routing]
A Hamiltonian circuit problem in which a traveler must find the most efficient way to visit a series of stops, then return to the starting location. In the original version of the problem, each stop may be visited only once.