×

Could a combinatorial optimization problem be solved by a differential equation? (English) Zbl 1032.90037

Summary: For the Traveling Salesman Problem (TSP), a combinatorial optimization problem, a feedforward artificial neural network model, the continuous Hopfield network model, is used to solve it. This neural network approach is based on the solution of a differential equation. An appropriate parameter setting of this differential equation can assure that the solution is associated with a tour for the TSP.

MSC:

90C27 Combinatorial optimization
68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68T05 Learning and adaptive systems in artificial intelligence
PDFBibTeX XMLCite