{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:32:15Z","timestamp":1649147535487},"reference-count":36,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1016\/s0165-1684(97)00100-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:19:37Z","timestamp":1027642777000},"page":"157-170","source":"Crossref","is-referenced-by-count":4,"title":["A bank of Hopfield neural networks for the shortest path problem"],"prefix":"10.1016","volume":"61","author":[{"given":"Carlos","family":"Bouso\u00f1o-Calz\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An\u00edbal R.","family":"Figueiras-Vidai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0165-1684(97)00100-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB2_1","doi-asserted-by":"crossref","unstructured":"S.V.B. Aiyer and F. Fallside, A hopfield network implementation of the viterbi algorithm for hidden markov models, Proc. Internat. Joint Conf. on Neural Networks, Vol. 2, pp. 827\u2013831","DOI":"10.1109\/IJCNN.1991.155441"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB2_2","first-page":"827","volume":"Vol. 2","author":"Aiyer","year":"1991"},{"issue":"6","key":"10.1016\/S0165-1684(97)00100-X_BIB3","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1109\/72.286889","article-title":"Neural networks for shortest path computations and routing in computer networks","volume":"4","author":"Ali","year":"1993","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01415008","article-title":"Investigation of the Hopfield model and its attractors","author":"Amin","year":"1994","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/S0165-1684(97)00100-X_BIB5","series-title":"Data Networks","author":"Bertsekas","year":"1992"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF01421958","article-title":"The hopfield neural network applied to the quadratic assignment problem","volume":"3","author":"Bouso\u00f1o-Calz\u00f3n","year":"1995","journal-title":"Neural Comput. Appl. J."},{"key":"10.1016\/S0165-1684(97)00100-X_BIB7","unstructured":"C. Bouso\u00f1o-Calz\u00f3n, A.R. Figueiras-Vidai, Reuse-type dynamic channel assignment with a Hopfield based neural network, IEEE Trans. Vehicular Technol., submitted."},{"issue":"3","key":"10.1016\/S0165-1684(97)00100-X_BIB8","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/18.335894","article-title":"Nondirect convergence radius and number of iterations of the hopfield associative memory","volume":"40","author":"Burshtein","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB9","series-title":"Neural Networks for Optimization and Signal Processing","author":"Cichocki","year":"1993"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0925-2312(94)E0063-W","article-title":"Neural networks for linear inverse problemswith incomplete data especially in applications to signal and image reconstruction","volume":"8","author":"Cichocki","year":"1995","journal-title":"Neurocomput."},{"key":"10.1016\/S0165-1684(97)00100-X_BIB11","first-page":"145","article-title":"A neural network algorithm to solve the routing problem in communication networks","volume":"Vol. 2","author":"Dixon","year":"1995"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB12","series-title":"Asyncronous Transfer Mode Solution for Broadband ISDN","author":"de Prycker","year":"1991"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB13","first-page":"752","article-title":"Communication network routing using neural nets numerical aspects and alternative approaches","volume":"Vol. 1","author":"Fritsh","year":"1991"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB14","series-title":"Research Report","article-title":"Artificial neural net applications in telecommunication systems","author":"Fritsh","year":"1992"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB15","series-title":"Neural Networks in Telecommunications","first-page":"37","article-title":"Routing n random multistage interconnection networks","author":"Goudreau","year":"1994"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB16","series-title":"Neural Networks; A Comprehensive Foundation","author":"Haykin","year":"1993"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB17","series-title":"Introduction to the Theory of Neural Computation","author":"Hertz","year":"1991"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB18","first-page":"2554","article-title":"Neural networks and physical systems with emergent collective computational abilities","volume":"79","author":"Hopfield","year":"1982"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB19","first-page":"3088","article-title":"Neurons with graded response have collective computational properties like those of two-state neurons","volume":"81","author":"Hopfield","year":"1984"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB20","series-title":"Neural Networks for Signal Procesing","author":"Kosko","year":"1992"},{"issue":"5","key":"10.1016\/S0165-1684(97)00100-X_BIB21","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/72.248462","article-title":"Neural networks for routing of communicaton networks with unreliable components","volume":"4","author":"Lee","year":"1993","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB22","first-page":"266","article-title":"Approximation theory and recurrent networks","volume":"Vol. 2","author":"Li","year":"1992"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB23","series-title":"Digital Spectral Analysis with Applications","author":"Marple","year":"1987"},{"issue":"4","key":"10.1016\/S0165-1684(97)00100-X_BIB24","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/TIT.1987.1057328","article-title":"The capacity of the hopfield associative memory","volume":"33","author":"McEliece","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB25","series-title":"Neural Networks and Speech Processing","author":"Morgan","year":"1991"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB26","series-title":"Proc. Internat. Workshop on Applications of Neural Networks to Telecommunications","first-page":"203","article-title":"Hopfield optimization techniques applied to routing in computer networks","author":"Nemhauser","year":"1993"},{"issue":"6","key":"10.1016\/S0165-1684(97)00100-X_BIB27","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1109\/49.400667","article-title":"Competitive routing of virtual circuits in ATM networks","volume":"13","author":"Plotkin","year":"1995","journal-title":"IEEE J. Select. Areas Comm"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB28","series-title":"Telecommunication Networks: Protocols, Modeling and Analysis","author":"Schwarte","year":"1988"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB29","series-title":"Artificial Neural Networks","article-title":"Image processing by neural network implementation of the 2-D Kaiman filter","author":"Skoneczny","year":"1991"},{"issue":"3","key":"10.1016\/S0165-1684(97)00100-X_BIB30","volume":"9","year":"1991","journal-title":"IEEE J. Select. Areas Comm."},{"key":"10.1016\/S0165-1684(97)00100-X_BIB31","series-title":"ISDN and Broadband ISDN with Frame Relay and ATM","author":"Stallings","year":"1995"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB32","series-title":"Neural Network Parallel Computing","author":"Takefuji","year":"1992"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB33","first-page":"2693","article-title":"Neural network implementation of the shortest path algorithm for traffic routing in communication networks","volume":"Vol. 3","author":"Thomopoulos","year":"1991"},{"key":"10.1016\/S0165-1684(97)00100-X_BIB34","first-page":"925","article-title":"Analysis and design of a recurrent neural network for real-time parameter estimation","volume":"Vol. 2","author":"Wang","year":"1992"},{"issue":"2","key":"10.1016\/S0165-1684(97)00100-X_BIB35","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1109\/72.207619","article-title":"Inhibitory grids and the assignment problem","volume":"4","author":"Wolfe","year":"1993","journal-title":"IEEE Trans. Neural Networks"}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016516849700100X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016516849700100X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T02:23:09Z","timestamp":1555467789000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016516849700100X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S016516849700100X"],"URL":"https:\/\/doi.org\/10.1016\/s0165-1684(97)00100-x","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}