Abstract
We study a heuristic paradigm of neural network algorithms for solving combinatorial optimization problems in a cellular architecture. As an illustration, we present a cellular neural-like algorithm for solving approximately the maximum independent set problem.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.J.Hopfield. Neural Networks and Physical Systems with Emergent Collective Computational Properties. Proc. Nat. Acad. Sci., USA, 79 (1982)2554.
J.J.Hopfield and D.W.Tank. Neural Computation of Decisions in Optimization Problems. Biol. Cybern., 52 (1985)141.
E.H.L.Aarts, J.H.M.Korst. Boltzmann Machines and Their Applications. Lect. Notes Comput. Sci., 258 (1987)34.
J.H.M.Korst, E.H.L.Aarts. Combinatorial Optimization on a Boltzmann Machine. J. Parallel Distrib. Comput., 6(2) (1989)331.
O.L.Bandman. Cellular-Neural Computations. Formal Model and Possible Applications. Lect. Notes Comput. Sci., 964 (1995)21.
S.M.Achasova, O.L.Bandman, V.P.Markova, S.V.Piskunov. Parallel Substitution Algorithm. Theory and Application. Singapore: World Scientific, 1994.
M.R.Garey and D.S.Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
Y.Pogudin. Simulation of Fine-Grained Parallel Algorithms with the ALT (Animated Language Tools) System. First International Workshop on Distributed Interactive Simulation and Real Time Applications (Proceedings), Eilat, Israel, Jan. 9–10, 1997, p.22.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Achasova, S.M. (1997). Cellular neural-like algorithms with heuristics for solving combinatorial optimization problems. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1997. Lecture Notes in Computer Science, vol 1277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63371-5_33
Download citation
DOI: https://doi.org/10.1007/3-540-63371-5_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63371-6
Online ISBN: 978-3-540-69525-7
eBook Packages: Springer Book Archive