Travelling salesman variation in python

[Erlend Andreas Garberg]

In article <7xhdw3zfb2.fsf at ruckus.brouhaha.com>, Paul Rubin wrote:
> Erlend Andreas Garberg <erlendga at tva.ifi.uio.no> writes:
>> An approximate solution would be good enough, do you have any 
>> suggestions about how do do that?
> 
> Is it just an arbitrary graph?  Most TSP approximation algorithms
> depend e.g. on the triangle inequality, i.e. d(A,C) <= d(A,B) + d(B,C).
> 
> Papadimitriou and Stieglitz, "Combinatorial Optimization" was a
> standard textbook on this stuff, though is pretty old by now.


The graph is arbitrary, yes..

-- 

mvh
Erlend Garberg
erlendga at ifi.uio.no