Travelling salesman variation in python

[Erlend Andreas Garberg]

In article <c4ho3l$4he$1 at news.service.uci.edu>, Josiah Carlson wrote:
> Look at current TSP algorithms, and exchange their minimization rutines 
> for a maximization rutine.  TSP is an NP-hard problem, which means that 
> there is no currently known algorithm for solving it in polynomial time. 
>   You can approximate it or do a search on the solution space, but 
> solving it requires searching basically all of the solution space.
> 
>   - Josiah

An approximate solution would be good enough, do you have any 
suggestions about how do do that?


--
mvh
Erlend Garberg
erlendga at ifi.uio.no