Modelling competitive Hopfield networks for the maximum clique problem
From MaRDI portal
Publication:1870811
DOI10.1016/S0305-0548(02)00028-XzbMath1026.90075OpenAlexW2005372336MaRDI QIDQ1870811
E. Mérida-Casermeiro, Gloria Galán-Marín, José Muñoz-Pérez
Publication date: 14 May 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00028-x
Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items (2)
Classification with incomplete survey data: a Hopfield neural network approach ⋮ A simple simulated annealing algorithm for the maximum clique problem
Cites Work
- Unnamed Item
- Unnamed Item
- An exact algorithm for the maximum clique problem
- ``Neural computation of decisions in optimization problems
- On the stability of the travelling salesman problem algorithm of Hopfield and Tank
- Experiments in quadratic 0-1 programming
- A note on the approximation of the MAX CLIQUE problem
- An artificial maximum neural network: A winner-take-all neuron model forcing the state of the system in a solution domain
- The maximum clique problem
- A maximum neural network approach for \(N\)-queens problems
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Finding a Maximum Clique in an Arbitrary Graph
- A global optimization approach for solving the maximum clique problem
- Neural Computing for Optimization and Combinatorics
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Neural networks and physical systems with emergent collective computational abilities.
- Neurons with graded response have collective computational properties like those of two-state neurons.
- A logical calculus of the ideas immanent in nervous activity
- A branch and bound algorithm for the maximum clique problem
This page was built for publication: Modelling competitive Hopfield networks for the maximum clique problem
