  In this work we revisit the Hopfield-Tank algorithm for the traveling
salesman problem (TSP) and report encouraging results, with a different
dynamics, that makes the algorithm more efficient finding better solutions in
much less computational time.
