Roger D. Brandt

Learn More
The authors demonstrate that Hopfield-type networks can find reasonable solutions to the traveling salesman problem (TSP) and the optimal list-matching problem (LMP). They show how to avoid the difficulties encountered by G.V. Wilson and G.S. Pawley (1988) by using a modified energy functional which yields better solutions to the TSP than J.J. Hopfield and(More)
  • 1