{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T07:45:49Z","timestamp":1777621549882,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T00:00:00Z","timestamp":1454025600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Government of Spain","award":["TIN2012-32482"],"award-info":[{"award-number":["TIN2012-32482"]}]},{"name":"Local Government of Madrid","award":["S2013\/ICE-2845 (CASI-CAM)"],"award-info":[{"award-number":["S2013\/ICE-2845 (CASI-CAM)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00500-016-2039-8","type":"journal-article","created":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T14:49:37Z","timestamp":1454078977000},"page":"3891-3905","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Improving the Hopfield model performance when applied to the traveling salesman problem"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5979-0463","authenticated-orcid":false,"given":"Lucas","family":"Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro M.","family":"Talav\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1636-1367","authenticated-orcid":false,"given":"Javier","family":"Y\u00e1\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,29]]},"reference":[{"key":"2039_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.neunet.2014.02.010","volume":"54","author":"M Marco Di","year":"2014","unstructured":"Di Marco M, Forti M, Grazzini M, Pancioni L (2014) Necessary and sufficient condition for multistability of neural networks evolving on a closed hypercube. Neural Netw 54:38\u201348","journal-title":"Neural Netw"},{"issue":"10","key":"2039_CR2","doi-asserted-by":"publisher","first-page":"3088","DOI":"10.1073\/pnas.81.10.3088","volume":"81","author":"JJ Hopfield","year":"1984","unstructured":"Hopfield JJ (1984) Neurons with graded response have collective computational properties like those of two-state neurons. Proc Natl Acad Sci 81(10):3088\u20133092","journal-title":"Proc Natl Acad Sci"},{"issue":"3","key":"2039_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield JJ, Tank DW (1985) \u201cNeural\u201d computation of decisions in optimization problems. Biol Cybern 52(3):141\u2013152","journal-title":"Biol Cybern"},{"issue":"7","key":"2039_CR4","doi-asserted-by":"publisher","first-page":"5331","DOI":"10.1016\/j.eswa.2010.01.002","volume":"37","author":"F Jolai","year":"2010","unstructured":"Jolai F, Ghanbari A (2010) Integrating data transformation techniques with Hopfield neural networks for solving travelling salesman problem. Expert Syst Appl 37(7):5331\u20135335","journal-title":"Expert Syst Appl"},{"key":"2039_CR5","unstructured":"Lawler EL (1985) The traveling salesman problem: a guided tour of combinatorial optimization. In: Wiley-Interscience series in discrete mathematics. Wiley, New York"},{"issue":"3","key":"2039_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1012751230791","volume":"14","author":"E M\u00e9rida-Casermeiro","year":"2001","unstructured":"M\u00e9rida-Casermeiro E, Gal\u00e1n-Mar\u00edn G, Munoz-Perez J (2001) An efficient multivalued Hopfield network for the traveling salesman problem. Neural Process Lett 14(3):203\u2013216","journal-title":"Neural Process Lett"},{"issue":"3","key":"2039_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou CH (1977) The Euclidean travelling salesman problem is NP-complete. Theor Comput Sci 4(3):237\u2013244","journal-title":"Theor Comput Sci"},{"issue":"4","key":"2039_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB. A traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"2039_CR9","unstructured":"Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer, New York"},{"issue":"7","key":"2039_CR10","doi-asserted-by":"publisher","first-page":"2210","DOI":"10.1016\/j.cor.2008.08.012","volume":"36","author":"S Salcedo-Sanz","year":"2009","unstructured":"Salcedo-Sanz S, Ortiz-Garc\u00eda EG, P\u00e9rez-Bellido \u00c1M, Portilla-Figueras A, L\u00f3pez-Ferreras F (2009) On the performance of the LP-guided Hopfield network-genetic algorithm. Comput Oper Res 36(7):2210\u20132216","journal-title":"Comput Oper Res"},{"key":"2039_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.neunet.2014.09.003","volume":"61","author":"J Schmidhuber","year":"2015","unstructured":"Schmidhuber J (2015) Deep learning in neural networks: an overview. Neural Netw 61:85\u2013117","journal-title":"Neural Netw"},{"key":"2039_CR12","doi-asserted-by":"crossref","unstructured":"Suh T, Esat II (1998) Solving large scale combinatorial optimisation problems based on a divide and conquer strategy. Neural Comput Appl 7(2):166\u2013179","DOI":"10.1007\/BF01414168"},{"issue":"3","key":"2039_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0893-6080(02)00021-7","volume":"15","author":"PM Talav\u00e1n","year":"2002","unstructured":"Talav\u00e1n PM, Y\u00e1\u00f1ez J (2002) Parameter setting of the Hopfield network applied to TSP. Neural Netw 15(3):363\u2013373","journal-title":"Neural Netw"},{"issue":"8","key":"2039_CR14","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.1016\/j.cor.2004.02.008","volume":"32","author":"PM Talav\u00e1n","year":"2005","unstructured":"Talav\u00e1n PM, Y\u00e1\u00f1ez J (2005) A continuous Hopfield network equilibrium points algorithm. Comput Oper Res 32(8):2179\u20132196","journal-title":"Comput Oper Res"},{"issue":"4","key":"2039_CR15","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.neunet.2005.10.008","volume":"19","author":"PM Talav\u00e1n","year":"2006","unstructured":"Talav\u00e1n PM, Y\u00e1\u00f1ez J (2006) The generalized quadratic knapsack problem. A neuronal network approach. Neural Netw 19(4):416\u2013428","journal-title":"Neural Netw"},{"issue":"5","key":"2039_CR16","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1109\/TCSI.2005.846666","volume":"52","author":"K Tan","year":"2005","unstructured":"Tan K, Tang H, Ge S (2005) On parameter settings of Hopfield networks applied to traveling salesman problems. IEEE Trans Circuits Syst I Regul Pap 52(5):994\u20131002","journal-title":"IEEE Trans Circuits Syst I Regul Pap"},{"key":"2039_CR17","doi-asserted-by":"crossref","unstructured":"Tang H, Tan KC, Zhang Y (2007) Neural networks: computational models and applications. Studies in Computational Intelligence, vol 53, Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-540-69226-3"},{"issue":"1","key":"2039_CR18","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1016\/S0925-2312(02)00596-9","volume":"48","author":"RL Wang","year":"2002","unstructured":"Wang RL, Tang Z, Cao QP (2002) A learning method in Hopfield neural network for combinatorial optimization problem. Neurocomputing 48(1):1021\u20131024","journal-title":"Neurocomputing"},{"issue":"3","key":"2039_CR19","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.ejor.2008.11.002","volume":"198","author":"U-P Wen","year":"2009","unstructured":"Wen U-P, Lan K-M, Shih H-S (2009) A review of Hopfield neural networks for solving mathematical programming problems. Eur J Oper Res 198(3):675\u2013687","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2039_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00363956","volume":"58","author":"G Wilson","year":"1988","unstructured":"Wilson G, Pawley G (1988) On the stability of the travelling salesman problem algorithm of Hopfield and tank. Biol Cybern 58(1):63\u201370","journal-title":"Biol Cybern"},{"key":"2039_CR21","doi-asserted-by":"crossref","unstructured":"Woeginger GJ (2003) Exact algorithms for NP-hard problems: a survey. In: Combinatorial Optimization Eureka, You Shrink!. Springer, New York, pp 185\u2013207","DOI":"10.1007\/3-540-36478-1_17"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2039-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2039-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2039-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2039-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T19:41:55Z","timestamp":1654198915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2039-8"}},"subtitle":["A divide-and-conquer scheme"],"short-title":[],"issued":{"date-parts":[[2016,1,29]]},"references-count":21,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["2039"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2039-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,29]]},"assertion":[{"value":"29 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}