{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:42Z","timestamp":1725663762852},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_253","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:38Z","timestamp":1330257938000},"page":"253-264","source":"Crossref","is-referenced-by-count":1,"title":["Global strategies for augmenting the efficiency of TSP heuristics"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Codenotti","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[]},{"given":"Luciano","family":"Margara","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Resta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"25_CR1","unstructured":"J. L. Bentley. Experiments on traveling salesman heuristics. Proc. 1st Symp. on Discrete Algorithms, 91\u201399, 1990."},{"key":"25_CR2","unstructured":"J. L. Bentley. Experiments on geometric traveling salesman heuristics. AT&T Bell Laboratories, Technical Report No. 151, August 1990."},{"key":"25_CR3","volume-title":"I.C.S.I. Technical Report 92-036","author":"B. Codenotti","year":"1992","unstructured":"B. Codenotti and L. Margara. Efficient clustering technique for the traveling salesman problem. I.C.S.I. Technical Report 92-036, International Computer Science Institute, Berkeley, CA 94704, June 1992."},{"key":"25_CR4","unstructured":"N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Management sciences research report No. 388, Carnegie-Mellon University, February 1976."},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1287\/opre.28.3.694","volume":"28","author":"B. L. Golden","year":"1980","unstructured":"B. L. Golden, L. D. Doyle, W. Stewart JR. Approximate traveling salesman algorithm. Oper. Res., (28):694\u2013711, 1980.","journal-title":"Oper. Res."},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R. Karp. The traveling salesman problem and minimum spanning trees. Oper. Res. 18:1138\u20131162, 1970.","journal-title":"Oper. Res."},{"key":"25_CR7","first-page":"446","volume":"443","author":"D. S. Johnson","year":"1990","unstructured":"D. S. Johnson. Local optimization and the traveling salesman problem. Proc. 17th Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science 443, 446\u2013461, 1990.","journal-title":"Proc. 17th Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D. S. Johnson","year":"1988","unstructured":"D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis. How easy is local search? J. Comput. System Sci. 37(1):79\u2013100, 1988.","journal-title":"J. Comput. System Sci."},{"key":"25_CR9","first-page":"493","volume":"21","author":"S. Lin","year":"1973","unstructured":"S. Lin and W. Kernighan. An effective heuristic algorithm for traveling salesman problem. Oper. Res., (21):493\u2013515, 1973.","journal-title":"Oper. Res."},{"key":"25_CR10","unstructured":"E. Lawler, J. Lenstra, A. Rinnoy Kan, and D. Shmoys. The traveling salesman problem. John Wiley and Sons, 1985."},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6377(92)90028-2","volume":"11","author":"O. Martin","year":"1992","unstructured":"O. Martin, S. W. Otto, and W. Feiten. Large-step markov chains for the TSP incorporating local search heuristics. Oper. Res. Lett., (11):219\u2013224, 1992.","journal-title":"Oper. Res. Lett."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"D. Rosenkrantz, R. Stearns and P. Lewis II. An analysis of several heuristics for the TSP. SIAM J. Comput., (6), 1977.","DOI":"10.1137\/0206041"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_253.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:18Z","timestamp":1605647298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_253","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}