problema do caixeiro viajante

Noun

 * 1)  travelling salesman problem problem involving the finding of a minimum-cost path that crosses all of a graph’s nodes