The traveling sales man problem:

Author Topic: The traveling sales man problem:  (Read 1288 times)

Offline PatreciaTopic starter

  • Trade Count: (0)
  • Full Member
  • ***
  • Thank You 2
  • Posts: 104
  • Karma: 1
  • Gender: Female
    • local search marketing
The traveling sales man problem:
« on: 07-18-2013, 12:12:00 »
The traveling sales man problem:
This one is famous intractable problem. Suppose you are a salesperson you need to drive all the cities where you have client and you have to minimize the number of miles you have traveled,  in graph theory this is called traveling salesman problem or TSP but can be solved by finding the Hamiltonian cycle in a graph. The time complexity of the algorithm is O (N!). This problem can also be solved using Dijkstra’s algorithm based on adjacency matrix representation of graphs.


 

Related Topics

  Subject / Started by Replies Last post
2 Replies
2103 Views
Last post 06-29-2010, 08:33:22
by seonew
1 Replies
2744 Views
Last post 12-13-2011, 06:59:28
by electra
1 Replies
1452 Views
Last post 09-19-2011, 03:27:03
by LeonForLinks
2 Replies
1750 Views
Last post 08-08-2012, 20:42:57
by Dennis Zocco
0 Replies
1018 Views
Last post 05-01-2013, 06:44:14
by Den Lloyd