Definition of an energy function for the random neural to solve optimization problems

Neural Networks

Volumn 11, Issue 4, 1998, Pages 731-737

  Jose, Aguilar ^a  

^a UNIVERSIDAD DE LOS ANDES   (Venezuela)

Author keywords

Energy function; Graph partitionning; Minimum node coveting; Neural networks; Optimization problems

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

GRAPH PARTITIONING PROBLEM; MASSIVELY PARALLEL ARCHITECTURE; MINIMUM NODE COVERING PROBLEM;

NEURAL NETWORKS;

ARTICLE; ARTIFICIAL NEURAL NETWORK; ENERGY; MATHEMATICAL ANALYSIS; MODEL; PRIORITY JOURNAL; SYSTEM ANALYSIS; THEORY;

EID: 0032100227     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-6080(98)00020-3     Document Type: Article

References (14)

1. Aguilar, J. (1992). Comparison between the random neural network model and other optimization combinatorial methods for large acyclic graph partitioning problem. In Proceedings of the 7th International Symposium on Computer and Information Sciences (pp. 565-569). Presses de l'Ecole des Hautes Etudes en Informatique, Paris.
2. Aguilar, J. (1994). An approach for combinatorial optimization problem based on learning in the recurrent random neural network. In World Congress on Neural Networks (pp. 420-425). Lawrence Erlbaum Associates, New Jersey.
3. Aguilar, J. (1995a). L'allocation de tâches, l'équilibrage de la charge et l'optimisation combinatoire. PhD thesis. Paris: Rene Descartes University.
4. Aguilar, J. (1995b). Evolutionary learning on recurrent random neural network. In World Congress on Neural Networks (pp. 232-236). Lawrence Erlbaum Associates, New Jersey.
5. Gelenbe E. Random neural networks with positive and negative signals and product form solution. Neural Computation. 1:1989;502-510.
6. Gelenbe E. Stable random neural networks. Neural Computation. 2:1990;239-247.
7. Gelenbe, E. (1991). Theory of the random neural network model. In E. Gelenbe (Ed.), Neural Networks: Advances and Applications (pp. 25-34). Amsterdam: North-Holland.
8. Gelenbe E. Learning in the recurrent random neural network. Neural Computation. 5:1993;364-378.
9. Gelenbe, E., & Batty, F. (1992). Application of the random neural network model to minimum graph covering. In E. Gelenbe (Ed.), Neural Networks: Advances and Applications 2 (pp. 85-96). Amsterdam: North Holland.
10. Grossberg S. Nonlinear neural networks: principles, mechanisms and architectures. Neural Networks. 1:1988;12-40.
11. Herault, C., & Niez, J. (1991). Neural networks and combinatorial optimization: a study of NP-complete graph problems. In E. Gelenbe (Ed.), Neural Networks: Advances and Applications (pp. 124-143). Amsterdam: North Holland.
12. Hopfield J., Tank D. Neural computation of decisions in optimization problem. Biolog. Cybern. 52:1985;141-152.
13. Pekergin, F. (1992). Optimisation combinatoire par le calcul neuronal et parallelisme optimal. PhD thesis. Paris: Rene Descartes University.
14. Tagliarini C., Fury J., Page E. Optimization using neural network. IEEE Transactions on Computers. 40:1991;1347-1358.