Reply to thread

Message: [QUOTE="Christian, post: 3597215"] Don't do this ... its just getting more complicated.. Just take Euklidean TSP ... Embed you m nodes in a 2 dimensional plane .. You get your distances as weights and everything is fine ... The Euclidean TSP is still NP hard. So it will solve normal TSP if you can solve it. I know people said you would have to create this data yourself in the previous thread... but that was only in general correct not in particular for this problem... there is no need to as Euclidean TSP has been prooven to be NP hard 30 years ago .. (also some good approximations exist to solve it) Christian [/QUOTE]