Search results with tag "Networks 3"

Networks 3: Traveling salesman problem

Traveling Salesperson Problem (TSP) Find the shortest distance tour passing through each node of the network exactly once. cij = distance

  Network, Problem, Salesman, Traveling, Networks 3, Traveling salesman problem