On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Biological Cybernetics
Code recognition and set selection with neural networks
Code recognition and set selection with neural networks
Optimization Using Neural Networks
IEEE Transactions on Computers - Special issue on artificial neural networks
Finding approximate solutions to NP-hard problems by neural networks is hard
Information Processing Letters
Neural networks and operations research: an overview
Computers and Operations Research - Special issue on neural networks and operations research
Neural network methods in combinatorial optimization
Computers and Operations Research - Special issue on neural networks and operations research
The guilty net for the traveling salesman problem
Computers and Operations Research - Special issue on neural networks and operations research
Learning to control dynamical behaviour
Physica D
Solving airline crew scheduling problems by branch-and-cut
Management Science
Easing the conscience of the guilty net
Computers and Operations Research
Computers and Operations Research
| Hi-index | 0.01 |
This paper explores different forms of custom dynamical systems for decision making. Curiously, covering and association constraints can be rather easily met, and it can sometimes be guaranteed that all feasible solutions (hence including the optimal solution) exist among the attractors. As yet, no general theory exists for designing such systems, but some titillating special cases can be described. Theorems for the pure differential equation layer can lead to simple and direct electronic implementation of new digital devices. The key strength of the application specific dynamical systems (ASDS) approach lies in the fact that all variables are updated in parallel. Thus ASDS method offers the potential of high speed solutions using modern high density integrated circuits hardware.