{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:18:37Z","timestamp":1725495517982},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540758662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75867-9_101","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T03:34:40Z","timestamp":1195184080000},"page":"804-811","source":"Crossref","is-referenced-by-count":3,"title":["Self-organizing Feature Maps to Solve the Undirected Rural Postman Problem"],"prefix":"10.1007","author":[{"given":"M. L.","family":"P\u00e9rez-Delgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. C.","family":"Matos-Franco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"101_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C.S. Orloff","year":"1974","unstructured":"Orloff, C.S.: A Fundamental Problem in Vehicle Routing. Networks\u00a04, 35\u201364 (1974)","journal-title":"Networks"},{"key":"101_CR2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc Routing Problems, Part II: The Rural Postman Problem. Operations Research\u00a043, 399\u2013414 (1995)","journal-title":"Operations Research"},{"key":"101_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01415960","volume":"35","author":"M. Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Optimal Control of Plotting and Drilling Machines: a Case Study. Mathematical Methods of Operations Research\u00a035, 61\u201384 (1991)","journal-title":"Mathematical Methods of Operations Research"},{"key":"101_CR4","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1057\/palgrave.jors.2601161","volume":"52","author":"G. Ghiani","year":"2001","unstructured":"Ghiani, G., Improta, G.: The Laser-Plotter Beam Routing Problem. Journal of the Operational Research Society\u00a052, 945\u2013951 (2001)","journal-title":"Journal of the Operational Research Society"},{"key":"101_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J.K. Lenstra","year":"1976","unstructured":"Lenstra, J.K., Rinnooy-Kan, A.H.G.: On General Routing Problems. Networks\u00a06, 273\u2013280 (1976)","journal-title":"Networks"},{"volume-title":"The Traveling Salesman Problem","year":"1985","key":"101_CR6","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy-Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem. John Wiley and Sons, Chichester (1985)"},{"key":"101_CR7","unstructured":"P\u00e9rez-Delgado, M.L.: Los Mapas de Rasgos Auto-Organizativos y el Problema del Viajante de Comercio. Ediciones Universidad de Salamanca, Spain (2004)"},{"key":"101_CR8","unstructured":"P\u00e9rez-Delgado, M.L.: Sistemas Multiagente para la Resoluci\u00f3n del Problema del Viajante de Comercio. IEEE Latin America Transactions\u00a02(1) (2004)"},{"key":"101_CR9","unstructured":"Christofides, N., Campos, V., Corber\u00e1n, A., Mota, E.: An Algorithm for the Rural Postman Problem. Imperial College Report. IC.O.R.81.5, London (1981)"},{"key":"101_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0377-2217(94)90398-0","volume":"79","author":"A. Corber\u00e1n","year":"1994","unstructured":"Corber\u00e1n, A., Sanchis, J.M.: A Polyhedral Approach to the Rural Postman Problem. European Journal of Operational Research\u00a079, 95\u2013114 (1994)","journal-title":"European Journal of Operational Research"},{"key":"101_CR11","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s101070050007","volume":"87","author":"G. Ghiani","year":"2000","unstructured":"Ghiani, G., Laporte, G.: A Branch and Cut Algorithm for the Undirected Rural Postman Problem. Mathematical Programming\u00a087, 467\u2013481 (2000)","journal-title":"Mathematical Programming"},{"key":"101_CR12","unstructured":"Letchford, A.N.: Polyhedral Results for some Constrained Arc Routing Problems. PhD Dissertation, Lancaster University. Lancaster (1996)"},{"key":"101_CR13","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"G. Frederickson","year":"1979","unstructured":"Frederickson, G.: Approximation Algorithms for some Postman Problems. Journal of the ACM\u00a026, 538\u2013554 (1979)","journal-title":"Journal of the ACM"},{"issue":"1","key":"101_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.5784\/21-1-17","volume":"21","author":"G.W. Groves","year":"2005","unstructured":"Groves, G.W., van Vuuren, J.H.: Efficient Heuristics for the Rural Postman Problem. Orion\u00a021(1), 33\u201351 (2005)","journal-title":"Orion"},{"key":"101_CR15","unstructured":"Baldoqu\u00edn, M.G.: Heuristics and Metaheuristics Approaches Used to Solve the Rural Postman Problem: A Comparative Case Study. Dpto. Matem\u00e1tica General, Facultad Ing. Industrial, Universidad T\u00e9cnica de La Habana, Cuba"},{"key":"101_CR16","series-title":"Springer Series in Information Sciences","volume-title":"Self-Organization and Associative Memory","author":"T. Kohonen","year":"1982","unstructured":"Kohonen, T.: Self-Organization and Associative Memory. Springer Series in Information Sciences, vol.\u00a08. Springer, Heidelberg (1982)"},{"key":"101_CR17","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Operations Research\u00a040, 1086\u20131094 (1992)","journal-title":"Operations Research"},{"key":"101_CR18","unstructured":"P\u00e9rez-Delgado, M.L., Calvo, J., Matos-Franco, J.C., P\u00e9rez-Iglesias, J.L.: The Undirected Rural Postman Problem Solved by Artificial Ants. In: Proc. 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria. Spain, pp. 279\u2013280 (2007)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory \u2013 EUROCAST 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75867-9_101.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:35:18Z","timestamp":1619519718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75867-9_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540758662"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75867-9_101","relation":{},"subject":[]}}