Neural networks for NP-complete problems
From MaRDI portal
Publication:4377229
DOI10.1016/S0362-546X(97)00308-8zbMath0894.90148MaRDI QIDQ4377229
Publication date: 7 September 1998
Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)
Related Items
Existence and stability of equilibria of the continuous-time Hopfield neural network ⋮ Finite-time synchronization of coupled Cohen-Grossberg neural networks with and without coupling delays
Uses Software
Cites Work
- A study of the application of Kohonen-type neural networks to the travelling salesman problem
- Self-organization and associative memory
- ``Neural computation of decisions in optimization problems
- On the stability of the travelling salesman problem algorithm of Hopfield and Tank
- The maximum clique problem
- Evolution towards the maximum clique
- Maxima for Graphs and a New Proof of a Theorem of Turán
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
- Unnamed Item
- Unnamed Item
- Unnamed Item