Re: semi-serious question on TSP
- From: bugbear <bugbear@xxxxxxxxxxxxxxxxxxxxxxxxx>
- Date: Fri, 22 Aug 2008 10:41:26 +0100
Rotwang wrote:
So if James really had an algorithm
which worked in O(n^3) that would be quite something.
He didn't have ANYTHING that worked,
and i any case the problem he thought
was the general TSP was actually
the Euclidean TSP!!
http://en.wikipedia.org/wiki/Traveling_salesman_problem#Heuristics
BugBear
.
- Prev by Date: Re: Dear Newsgroup
- Next by Date: Re: Dear Newsgroup
- Previous by thread: Quartic Equation: do you know a procedural way to solve it ?
- Next by thread: solutions manuals
- Index(es):
