Hi all,
New free tool for TSP solving is available (for downloading as well) - OpenOpt TSP class: TSP <http://openopt.org/TSP> (traveling salesman problem). It is written in Python, uses NetworkX <http://networkx.lanl.gov/> graphs on input (another BSD-licensed Python library, de-facto standard graph lib for Python language programmers), can connect to MILP solvers like glpk, cplex, lpsolve, has a couple of other solvers - sa (simulated annealing, Python code by John Montgomery) and interalg <http://openopt.org/interalg> <http://openopt.org/interalg> If someone is interested, I could implement something from (or beyound) its future plans till next OO stable release 0.41, that will be 2 weeks later (Sept-15). Regards, D. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To post to this group, send email to sage-support@googlegroups.com. To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support?hl=en.
