Results 1 to 3 of 3

Math Help - Discrete Math Traveling Salesperson

  1. #1
    Newbie
    Joined
    Apr 2008
    Posts
    1

    Discrete Math Traveling Salesperson

    A salesperson is traveling through 6 cities. There is a weighted graph of 23, 25, 27, 31, 36, and 45. I know there are 60 possible routes. n-1/2 or 5!/2=60. How do I find the shortest or lowest number route?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member angel.white's Avatar
    Joined
    Oct 2007
    Posts
    723
    Awards
    1
    There are 6 algorithms at this link
    Shortest path problem - Wikipedia, the free encyclopedia
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Grand Panjandrum
    Joined
    Nov 2005
    From
    someplace
    Posts
    14,972
    Thanks
    4
    Quote Originally Posted by desith87 View Post
    A salesperson is traveling through 6 cities. There is a weighted graph of 23, 25, 27, 31, 36, and 45. I know there are 60 possible routes. n-1/2 or 5!/2=60. How do I find the shortest or lowest number route?
    Is this complete? Should the weights not be associated with edges? What are the edges or whatever.

    RonL
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. TSP travelling salesperson problem
    Posted in the Advanced Math Topics Forum
    Replies: 7
    Last Post: March 2nd 2010, 05:07 PM
  2. Discrete Math
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: February 14th 2008, 03:17 PM
  3. New To Discrete Math - HELP :(
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: January 17th 2008, 10:56 AM
  4. Discrete Math
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: April 26th 2007, 12:01 AM
  5. Discrete Math
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: April 25th 2007, 02:20 PM

Search Tags


/mathhelpforum @mathhelpforum