Example: tourism industry

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

Tags:

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

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Related search queries