Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization

Mathematics and Computers in Simulation

Volumn 64, Issue 2, 2004, Pages 279-293

  Serpen, Gursel ^a  

^a Toledo   (United States)

Author keywords

Artificial neural network; Computational complexity; Hopfield neural network; Huge data array; Large scale simulation; Optimization; Simulation; Weight matrix

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; TOPOLOGY; VECTORS;

HUGE DATA ARRAY; LARGE SCALE SIMULATION (LSS); WEIGHT MATRIX;

NEURAL NETWORKS;

EID: 0346969700     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.matcom.2003.09.023     Document Type: Article

References (15)

1. Smith K. Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1):1999;15-34.
2. Gall A.L., Zissimopoulos V. Extended Hopfield models for combinatorial optimization. IEEE Trans. Neural Networks. 10(1):1999;72-80.
3. Matsuda S. Optimal Hopfield network for combinatorial optimization with linear cost function. IEEE Trans. Neural Networks. 9(6):1998;1319-1330.
4. Li S.Z. Improving convergence and solution quality of Hopfield-type neural networks with augmented lagrange multipliers. IEEE Trans. Neural Networks. 7(6):1996;1507-1516.
5. Cavalieri S., Mirabella O. Neural networks for process scheduling in real-time communication systems. IEEE Trans. Neural Networks. 7(5):1996;1272-1285.
6. Serpen G., Parvin A. On the performance of Hopfield network for graph search problem. Neurocomput.: Int. J. 14:1997;365-381.
7. Hopfield J.J. Neural networks and physical systems with emergent collective computational properties. Proc. Natl. Acad. Sci. U.S.A. 79:1982;2554-2558.
8. Hopfield J.J. Neurons with graded response have collective computational properties like those of two-state neurons. Proc. Natl. Acad. Sci. U.S.A. 81:1984;3088-3092.
9. Hopfield J.J., Tank D.W. Neural computations of decisions in optimization problems. Biol. Cybern. 52:1985;141-152.
10. Hopfield J.J., Tank D.W. Computing with neural networks: a model. Science. 233:1986;625-632.
11. M. Balsi, Hardware supervised learning for cellular and hopfield neural networks, in: Proceedings of World Congress on Neural Networks, San Diego, CA, 4-9 June, 1994 pp. 451-456.
12. Shutler P.M.E. An improved branching rule for the symmetric Traveling Salesman Problem. J. Oper. Res. Soc. 52(2):2001;169-175.
13. K. Chellapilla, D.B. Fogel, Exploring self-adaptive methods to improve the efficiency of generating approximate solutions to Traveling Salesman Problems using evolutionary programming, Evolutionary Programming, vol. VI, Springer-Verlag, Berlin, 1997 pp. 361-371.
14. D.S. Johnson, L.A. McGeoch, E.E. Rothberg, Asymptotic experimental analysis for the held-karp Traveling Salesman Bound, in: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, Georgia, 1996, pp. 341-350.
15. Serpen G., Livingston D.L. Determination of weights for relaxation recurrent neural networks. Neurocomput.: Int. J. 34(1-4):2000;145-168.