Neural networks for NP-complete problems (Q4377229)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 1115875

Language	Label	Description	Also known as
English	Neural networks for NP-complete problems	scientific article; zbMATH DE number 1115875

Statements

scholarly article

0 references

Neural networks for NP-complete problems (English)

0 references

0 references

Nonlinear Analysis: Theory, Methods & Applications

0 references

publication date

7 September 1998

0 references

zbMATH Keywords

neural networks

0 references

approximate solutions

0 references

NP-complete problems

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology

0 references

Evolution towards the maximum clique

0 references

0 references

A study of the application of Kohonen-type neural networks to the travelling salesman problem

0 references

``Neural'' computation of decisions in optimization problems

0 references

0 references

Self-organization and associative memory

0 references

Maxima for Graphs and a New Proof of a Theorem of Turán

0 references

The maximum clique problem

0 references

0 references

On the stability of the travelling salesman problem algorithm of Hopfield and Tank

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0362-546X(97)00308-8

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4377229

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4377229&oldid=34196637"