Reply to thread

Message: [QUOTE="JSH, post: 3614165"] Ok. Back full circle as I have already stated that I'm looking for coders for my OPE project where that stands for optimal path engine which implements the full algorithm where I've simplified things for this discussion relating to the Euclidean TSP as I think it's easier. The full algorithm goes beyond TSP to handle nodes that do not connect to all other nodes, so that it can even handle hubs where one node is visited multiple times. I'm simply talking about the TSP now as an easy frame of reference as the full OPE goes far beyond it. James Harris [/QUOTE]