An artificial maximum neural network: A winner-take-all neuron model forcing the state of the system in a solution domain

DOI10.1007/BF00204397zbMath0800.68424OpenAlexW2158009048MaRDI QIDQ1193738

Kuo-Chun Lee, Yoshiyasu Takefuji, Hideo Aiso

Publication date: 27 September 1992

Published in: Biological Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00204397

zbMATH Keywords

polynomial time algorithmNP-completebipartite supgraph problemmodule orientation problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

A columnar competitive model for solving multi-traveling salesman problem ⋮ A neural network approach to facility layout problems ⋮ Modelling competitive Hopfield networks for the maximum clique problem

Cites Work

• Optimization by Simulated Annealing
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• A logical calculus of the ideas immanent in nervous activity
• Unnamed Item

This page was built for publication: An artificial maximum neural network: A winner-take-all neuron model forcing the state of the system in a solution domain