Travelling salesman variation in python

[Günter Jantzen]

Can't TSP be converted to your problem?

If you have TSP with distance(Xi, Xj)=Dij, then convert it to your
problem by letting distance(X'i, X'j)=distance(X'j, X'i)=-Dij.
or if only positive weights are allowed then use max(D)-Dij.

Jeff

Of course, Jeff you are right!

There is a lot of pointers at the ACM portal

http://portal.acm.org/results.cfm?coll=Portal&dl=Portal&CFID=19701367&CFTOKE
N=66344476

Günter