Modelling competitive Hopfield networks for the maximum clique problem
type: Item
instance of: scholarly article
title: Modelling competitive Hopfield networks for the maximum clique problem
zbMATH Open document ID: 1026.90075
DOI: 10.1016/S0305-0548(02)00028-X
author: E. Mérida-Casermeiro
author: Gloria Galán-Marín
author: José Muñoz Pérez
published in: Computers \& Operations Research
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 92B20
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1910184
zbMATH Keywords: maximum clique
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: discrete Hopfield model
zbMATH Keywords: maximum neural network
zbMATH Keywords: algorithm
MaRDI profile type: Publication
cites work: Q4198056
cites work: The maximum clique problem
cites work: A note on the approximation of the MAX CLIQUE problem
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: A global optimization approach for solving the maximum clique problem
cites work: An exact algorithm for the maximum clique problem
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: A branch and bound algorithm for the maximum clique problem
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Neurons with graded response have collective computational properties like those of two-state neurons.
cites work: Neural networks and physical systems with emergent collective computational abilities.
cites work: On the stability of the travelling salesman problem algorithm of Hopfield and Tank
cites work: Q4003539
cites work: Neural Computing for Optimization and Combinatorics
cites work: A maximum neural network approach for \(N\)-queens problems
cites work: A logical calculus of the ideas immanent in nervous activity
cites work: An artificial maximum neural network: A winner-take-all neuron model forcing the state of the system in a solution domain
cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming
cites work: Experiments in quadratic 0-1 programming
full work available at URL: s0305-0548(02)00028-x
OpenAlex ID: W2005372336
Recommended article: An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning
Recommended article: A neural algorithm for the maximum clique problem: Analysis, experiments, and circuit implementation
Recommended article: Advances in Artificial Intelligence
Recommended article: Q5687255
description: scientific article; zbMATH DE number 1910184