Abstract
In this article we study the spatiotemporal complex dynamics of chaotic neural networks and their relationships with combinatorial optimization. In particular, we apply chaotic neural networks to the traveling salesman problem as a typical example of combinatorial optimization problems and analyze the nonlinear computational dynamics by comparing its characteristics with those of other dynamical models.
Get full access to this article
View all access options for this article.
