{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:37Z","timestamp":1761611077182,"version":"3.41.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Processing Letters"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1023\/a:1012751230791","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T14:27:29Z","timestamp":1040653649000},"page":"203-216","source":"Crossref","is-referenced-by-count":42,"title":["An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem"],"prefix":"10.1007","volume":"14","author":[{"given":"E.","family":"M\u00e9rida-Casermeiro","sequence":"first","affiliation":[]},{"given":"G.","family":"Gal\u00e1n-Mar\u00edn","sequence":"additional","affiliation":[]},{"given":"J.","family":"Mu\u00f1oz-P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"382488_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J. J. Hopceld","year":"1985","unstructured":"Hopceld, J. J. and Tank, D. W.: Neural computation of decisions in optimization problems, Biol. Cybern.\n52 (1985), 141\u2013152.","journal-title":"Biol. Cybern."},{"key":"382488_CR2","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"J. J. Hopceld","year":"1982","unstructured":"Hopceld, J. J.: Neural Networks and physical systems with emergent collective computational abilities, Proc. Ac. Academy Sci. USA\n79 (1982), 2554\u20132558.","journal-title":"Proc. Ac. Academy Sci. USA"},{"key":"382488_CR3","doi-asserted-by":"crossref","first-page":"3088","DOI":"10.1073\/pnas.81.10.3088","volume":"81","author":"J. J. Hopceld","year":"1984","unstructured":"Hopceld, J. J.: Neurons with graded response have collective computational properties like those of two-state neurons, Proc. Ac. Academy Sci. USA\n81 (1984), 3088\u20133092.","journal-title":"Proc. Ac. Academy Sci. USA"},{"key":"382488_CR4","volume-title":"Neurocomputers-An overview of neural Networks in VLSI","author":"M. Glesner","year":"1994","unstructured":"Glesner, M. and P\u00f6chm\u00fcller, W.: Neurocomputers-An overview of neural Networks in VLSI. London: Chapman and Hall, 1994."},{"key":"382488_CR5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1109\/72.363476","volume":"6","author":"S. Shams","year":"1995","unstructured":"Shams, S. and Gaudiot, J. L.: Implementing regularly structured neural networks on the DREAM machine, IEEE Trans. Neural Networks\n6 (1995), 407\u2013421.","journal-title":"IEEE Trans. Neural Networks"},{"key":"382488_CR6","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1364\/AO.24.001469","volume":"4","author":"N. H. Farhat","year":"1985","unstructured":"Farhat, N. H., Psaltis, D., Prata, A. and Peak, E.: Optical implementation of the Hopceld model, Appl. Opt.\n4 (1985), 1469\u20131475.","journal-title":"Appl. Opt."},{"key":"382488_CR7","volume-title":"The traveling salesman problem","author":"E. L. Lawler","year":"1985","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B.: The traveling salesman problem, New York: Wiley, 1985."},{"key":"382488_CR8","volume-title":"Modern heuristic techniques for combinatorial problems","author":"C. R. Reeves","year":"1993","unstructured":"Reeves, C. R.: Modern heuristic techniques for combinatorial problems, Oxford: Blackwell, 1993."},{"key":"382488_CR9","volume-title":"Computers and Intractability: A Guide to the theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the theory of NP-Completeness, New York: W. H. Freeman, 1979."},{"key":"382488_CR10","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S. and Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem, Operations Research\n21 (1973), 498\u2013516.","journal-title":"Operations Research"},{"key":"382488_CR11","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-a travelling salesman problem library, ORSA Journal on Computing\n3 (1991), 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"key":"382488_CR12","volume-title":"The travelling salesman. Computational solutions for TSP applications","author":"G. Reinelt","year":"1994","unstructured":"Reinelt, G.: The travelling salesman. Computational solutions for TSP applications, Berlin: Springer, 1994."},{"key":"382488_CR13","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/S0893-6080(99)00063-5","volume":"12","author":"N. Aras","year":"1999","unstructured":"Aras, N., Oomen, B. J. and Altinel, I. K.: The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem, Neural Networks\n12 (1999), 1273\u20131284.","journal-title":"Neural Networks"},{"key":"382488_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0305-0548(92)90047-9","volume":"19","author":"L. I. Burke","year":"1992","unstructured":"Burke, L. I. and Damany, P.: The guilty net for the travelling salesman problem, Computers and Operations Research\n19 (1992), 255\u2013265.","journal-title":"Computers and Operations Research"},{"key":"382488_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97610-0","volume-title":"Self-organizing maps","author":"T. Kohonen","year":"1995","unstructured":"Kohonen, T.: Self-organizing maps, Berlin: Springer, 1995."},{"issue":"1","key":"382488_CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1162\/neco.1994.6.1.161","volume":"6","author":"A. H. Gee","year":"1994","unstructured":"Gee, A. H. and Prager, R. W.: Polyhedral combinatorics and neural networks, Neural Computation\n6(1) (1994), 161\u2013180.","journal-title":"Neural Computation"},{"issue":"6","key":"382488_CR17","doi-asserted-by":"crossref","first-page":"1542","DOI":"10.1109\/72.548187","volume":"7","author":"K. Smith","year":"1996","unstructured":"Smith, K.: An argument for abandoning the traveling salesman problem as a neuralnetwork benchmark, IEEE Trans on Neural Networks\n7(6) (1996), 1542\u20131544.","journal-title":"IEEE Trans on Neural Networks"},{"key":"382488_CR18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00363956","volume":"58","author":"V. Wilson","year":"1988","unstructured":"Wilson, V. and Pawley, G. S.: On the stability of the TSP problem algorithm of Hopceld and Tank, Biological Cybernetics\n58 (1988), 63\u201370.","journal-title":"Biological Cybernetics"},{"issue":"6","key":"382488_CR19","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1016\/0893-6080(96)00016-0","volume":"9","author":"M. Erdem","year":"1996","unstructured":"Erdem, M. and Ozturk, Y.: A New Family of Multivalued Networks, Neural Networks\n9(6) (1996), 979\u2013989.","journal-title":"Neural Networks"},{"issue":"7","key":"382488_CR20","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1016\/0893-6080(96)00017-2","volume":"9","author":"M. Peng","year":"1996","unstructured":"Peng, M., Gupta, N. K. and Armitage, A. A. F.: An investigation into the Improvement of Local Minima of the Hopceld Network, Neural Networks\n9(7) (1996), 1241\u20131253.","journal-title":"Neural Networks"},{"issue":"6","key":"382488_CR21","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1109\/72.548179","volume":"7","author":"S. Z. Li","year":"1996","unstructured":"Li, S. Z.: Improving Convergence and Solution Quality of Hopceld-Type Neural Networks with Augmented LagrangeMultipliers, IEEE Trans. on Neural Networks\n7(6) (1996), 1507\u20131516.","journal-title":"IEEE Trans. on Neural Networks"},{"key":"382488_CR22","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0893-6080(00)00012-5","volume":"13","author":"M. Mart\u00edn-Valdivia","year":"2000","unstructured":"Mart\u00edn-Valdivia, M., Ruiz-Sep\u00falveda, A. and Triguero-Ruiz, F.: Improving local minima of Hopceld networks with augmented Lagrange multipliers for large scale TSPs, Neural Networks\n13 (2000), 283\u2013285.","journal-title":"Neural Networks"},{"key":"382488_CR23","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1018780424422","volume":"10","author":"X. Zeng","year":"1999","unstructured":"Zeng, X. and Martinez, T.: A New Relaxation Procedure in the Hopceld Network for solving Optimization Problems, Neural Processing Letters\n10 (1999), 211\u2013222.","journal-title":"Neural Processing Letters"},{"key":"382488_CR24","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D. S. Johnson","year":"1997","unstructured":"Johnson, D. S. and McGeoh, L. A.: The Traveling Salesman Problem: A Case Study in Local Optimization, In: E. H. Aarts and J. K. Lenstra (eds.), Local Search in Combinatorial Optimization, John Wiley and Sons: London, 1997, pp. 215\u2013310."},{"key":"382488_CR25","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1007\/BF01009452","volume":"34","author":"S. Kirkpatrick","year":"1984","unstructured":"Kirkpatrick, S.: Optimization by simulated annealing: Quantitative studies, J. Stat. Physics\n34 (1984), 976-986.","journal-title":"J. Stat. Physics"},{"key":"382488_CR26","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P.: Optimization by Simulated Annealing, Science\n220 (1983), 671\u2013680.","journal-title":"Science"},{"key":"382488_CR27","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cerny","year":"1985","unstructured":"Cerny, V.: A Thermodynamical Approach to the Travelling Salesman Problem: An Efccient Simulation Algorithm, J. Optimization Theory and Appl.\n45 (1985), 41\u201351.","journal-title":"J. Optimization Theory and Appl."},{"key":"382488_CR28","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G. A. Croes","year":"1958","unstructured":"Croes, G. A.: A method for solving traveling salesman problems, Operations Research\n6 (1958) 791\u2013812.","journal-title":"Operations Research"},{"key":"382488_CR29","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to articcial intelligence, Computers & Ops. Res.\n13 (1986), 533\u2013549.","journal-title":"Computers & Ops. Res."},{"key":"382488_CR30","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/S0893-6080(05)80132-7","volume":"6","author":"S. Mehta","year":"1993","unstructured":"Mehta, S. and Fulop, L.: An analog Neural Network to Solve the Hamiltonian Cycle Problem, Neural Networks\n6 (1993), 869\u2013881.","journal-title":"Neural Networks"},{"key":"382488_CR31","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0893-6080(88)90002-0","volume":"1","author":"B. Ang\u00e9niol","year":"1988","unstructured":"Ang\u00e9niol, B., Vaubois, G. and Texier, J.: Self-organizing feature maps and the Traveling Salesman problem, Neural Networks\n1 (1988), 289\u2013283.","journal-title":"Neural Networks"},{"key":"382488_CR32","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1038\/326689a0","volume":"326","author":"R. Durbin","year":"1987","unstructured":"Durbin, R. and Willshaw, D.: An analogue approach to the Traveling Salesman Problem using an elastic net method, Nature\n326 (1987), 689\u2013691.","journal-title":"Nature"},{"key":"382488_CR33","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0893-6080(91)90004-O","volume":"4","author":"X. Xu","year":"1991","unstructured":"Xu, X. and Tsai, W. T.: Effective neural algorithms for the travelling salesman problem, Neural Networks\n4 (1991), 193\u2013205.","journal-title":"Neural Networks"},{"issue":"2","key":"382488_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/72.914527","volume":"12","author":"G. Gal\u00e1n-Mar\u00edn","year":"2001","unstructured":"Gal\u00e1n-Mar\u00edn, G. and Mu\u00f1oz-P\u00e9rez, J.: Design and Analysis of Maximum Hopceld Networks, IEEE Trans. on Neural Networks\n12(2) (2001), 1\u201311.","journal-title":"IEEE Trans. on Neural Networks"},{"key":"382488_CR35","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0098187","volume-title":"Lecture Notes in Computer Science, Foundations and Tools for Neural Modeling","author":"G. Gal\u00e1n-Mar\u00edn","year":"1999","unstructured":"Gal\u00e1n-Mar\u00edn, G. and Mu\u00f1oz-P\u00e9rez, J.: A new input-output function for binary Hopceld Neural Networks, Lecture Notes in Computer Science, Foundations and Tools for Neural Modeling, Springer Verlag, Berlin, (1999) vol. 1606, pp. 311\u2013320."},{"key":"382488_CR36","first-page":"6","volume":"8","author":"G. Gal\u00e1n-Mar\u00edn","year":"1999","unstructured":"Gal\u00e1n-Mar\u00edn, G. and Mu\u00f1oz-P\u00e9rez, J.: Design of a Neural Network for solving the Four-Color-Map Problem, Iberoamerican Journal of Artificial Intelligence\n8 (1999), 6\u201317, (In Spanish).","journal-title":"Iberoamerican Journal of Artificial Intelligence"},{"key":"382488_CR37","volume-title":"Recurrent Neural Networks for Combinatorial Optimization","author":"G. Gal\u00e1n-Mar\u00edn","year":"2000","unstructured":"Gal\u00e1n-Mar\u00edn, G.: Recurrent Neural Networks for Combinatorial Optimization, Ph.D. dissertation, University of M\u00e1laga, M\u00e1laga, Spain, 2000 (In Spanish)."},{"key":"382488_CR38","unstructured":"Gal\u00e1n-Mar\u00edn, G. and Mu\u00f1oz-P\u00e9rez, J.: Finding Near-Maximum Cliques with Competitive Hopceld Networks, Proc. of International ICSC Symposium on Neural Computation, Berlin, Germany (2000), pp. 62\u201369."},{"key":"382488_CR39","volume-title":"Recurrent Multivalued Neural Networks for Combinatorial Optimization and Pattern Recognition","author":"E. M\u00e9rida-Casermeiro","year":"2000","unstructured":"M\u00e9rida-Casermeiro, E.: Recurrent Multivalued Neural Networks for Combinatorial Optimization and Pattern Recognition, Ph.D. dissertation, University of M\u00e1laga, M\u00e1laga, Spain, 2000 (In Spanish)."}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012751230791.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1012751230791\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012751230791.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T09:22:47Z","timestamp":1749720167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1012751230791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["382488"],"URL":"https:\/\/doi.org\/10.1023\/a:1012751230791","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}