SQLTeam.com | Weblogs | Forums

Traveling salesman problem with ordering


#1

Two groups with equal number of nodes. Nodes in the second group can only be visited after their corresponding nodes in the first group are visited.

I want to know whether there are some alogirthms to solve this kind of TSP.

Thanks a lot!


#2

Please provide:

  • table difinitions in the form of create statements
  • sample data in the form of insert statements
  • the query you got so far (and error message if any)
  • expected output from the sample data you provide