{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:44:15Z","timestamp":1775328255354,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319076942","type":"print"},{"value":"9783319076959","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07695-9_27","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T22:45:16Z","timestamp":1402440316000},"page":"281-291","source":"Crossref","is-referenced-by-count":10,"title":["Self-Organizing Map for the Prize-Collecting Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Jan","family":"Faigl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey A.","family":"Hollinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: CONCORDE TSP Solver (2003), \n                      http:\/\/www.tsp.gatech.edu\/concorde.html\n                     (cited October 20, 2013)"},{"key":"27_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D. Applegate","year":"2007","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for prize-collecting steiner tree and tsp. In: IEEE Symposium on Foundations of Computer Science (2009)","DOI":"10.1109\/FOCS.2009.39"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Bonifaci, V., Leonardi, S., Marchetti-Spaccamala, A.: Prize-collecting traveling salesman and related problems. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. CRC Press (2007)","DOI":"10.1201\/9781420010749.ch40"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problems. Networks\u00a019, 621\u2013636 (1989)","journal-title":"Networks"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Mathematical Programming\u00a059, 413\u2013420 (1993)","journal-title":"Mathematical Programming"},{"issue":"10","key":"27_CR7","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1016\/S0893-6080(03)00056-X","volume":"16","author":"E.M. Cochrane","year":"2003","unstructured":"Cochrane, E.M., Beasley, J.E.: The co-adaptive neural network approach to the Euclidean travelling salesman problem. Neural Networks\u00a016(10), 1499\u20131525 (2003)","journal-title":"Neural Networks"},{"issue":"4-6","key":"27_CR8","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","volume":"72","author":"J.C. Cr\u00e9put","year":"2009","unstructured":"Cr\u00e9put, J.C., Koukam, A.: A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing\u00a072(4-6), 1250\u20131264 (2009)","journal-title":"Neurocomputing"},{"issue":"10","key":"27_CR9","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TNN.2010.2070518","volume":"21","author":"J. Faigl","year":"2010","unstructured":"Faigl, J.: Approximate Solution of the Multiple Watchman Routes Problem with Restricted Visibility Range. IEEE Transactions on Neural Networks\u00a021(10), 1668\u20131679 (2010)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-21735-7_11","volume-title":"Artificial Neural Networks and Machine Learning \u2013 ICANN 2011","author":"J. Faigl","year":"2011","unstructured":"Faigl, J., P\u0159eu\u010dil, L.: Self-Organizing Map for the Multi-Goal Path Planning with Polygonal Goals. In: Honkela, T. (ed.) ICANN 2011, Part I. LNCS, vol.\u00a06791, pp. 85\u201392. Springer, Heidelberg (2011)"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Computing\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM J. Computing"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. European Journal of Operational Research\u00a0126(1) (2000)","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Hollinger, G., Mitra, U., Sukhatme, G.: Autonomous data collection from underwater sensor networks using acoustic communication. In: IROS, pp. 3564\u20133570. IEEE (2011)","DOI":"10.1109\/IROS.2011.6094986"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Somhom, S., Modares, A., Enkawa, T.: A self-organising model for the travelling salesman problem. Journal of the Operational Research Society, 919\u2013928 (1997)","DOI":"10.1057\/palgrave.jors.2600439"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Tucci, M., Raugi, M.: Stability analysis of self-organizing maps and vector quantization algorithms. In: IJCNN, pp. 1\u20135 (2010)","DOI":"10.1109\/IJCNN.2010.5596939"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Self-Organizing Maps and Learning Vector Quantization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07695-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T01:10:51Z","timestamp":1615425051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07695-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076942","9783319076959"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07695-9_27","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}