{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:34Z","timestamp":1725557974470},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143540"},{"type":"electronic","value":"9783642143557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14355-7_13","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T09:34:40Z","timestamp":1277285680000},"page":"119-130","source":"Crossref","is-referenced-by-count":3,"title":["Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction"],"prefix":"10.1007","author":[{"given":"Christian","family":"Ernst","sequence":"first","affiliation":[]},{"given":"Changxing","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Gerold","family":"J\u00e4ger","sequence":"additional","affiliation":[]},{"given":"Dirk","family":"Richter","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Molitor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"A Computational Study","author":"D.L. Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem. In: A Computational Study. Princeton University Press, Princeton (2006)"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.orl.2008.09.006","volume":"37","author":"D.L. Applegate","year":"2009","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J., Espinoza, D., Goycoolea, M., Helsgaun, K.: Certification of an Optimal Tour through 85,900 Cities. Operations Research Letters\u00a037(1), 11\u201315 (2009)","journal-title":"Operations Research Letters"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W. Cook","year":"2003","unstructured":"Cook, W., Seymour, P.: Tour Merging via Branch-Decomposition. INFORMS Journal on Computing\u00a015(3), 233\u2013248 (2003)","journal-title":"INFORMS Journal on Computing"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-02158-9_16","volume-title":"Algorithmic Aspects in Information and Management","author":"C. Dong","year":"2009","unstructured":"Dong, C., J\u00e4ger, G., Richter, D., Molitor, P.: Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. In: Goldberg, A.V., Zhou, Y. (eds.) AAIM 2009. LNCS, vol.\u00a05564, pp. 175\u2013187. Springer, Heidelberg (2009)"},{"volume-title":"The Traveling Salesman Problem and Its Variations","year":"2002","key":"13_CR5","unstructured":"Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. European Journal Operations Research\u00a0126(1), 106\u2013130 (2000)","journal-title":"European Journal Operations Research"},{"key":"13_CR7","unstructured":"Helsgaun, K.: An Effective Implementation of k-opt Moves for the Lin-Kernighan TSP Heuristic. In: Writings in Computer Science, vol.\u00a0109. Roskilde University (2006)"},{"issue":"2-3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K. Helsgaun","year":"2009","unstructured":"Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Mathematical Programming Computation\u00a01(2-3), 119\u2013163 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"13_CR9","unstructured":"Helsgaun, K.: Private Communication (March 2009)"},{"volume-title":"The Traveling Salesman Problem - A Guided Tour of Combinatorial Optimization","year":"1985","key":"13_CR10","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.): The Traveling Salesman Problem - A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chicester (1985)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"13_CR12","unstructured":"Walshaw, C.: A Multilevel Lin-Kernighan-Helsgaun Algorithm for the Travelling Salesman Problem. TR 01\/IM\/80, Computing and Mathematical Sciences, University of Greenwich, UK (2001)"},{"key":"13_CR13","unstructured":"Zhang, W., Looks, M.: A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones. In: Proc. of the 19th Int\u2019l Joint Conf. on Artificial Intelligence (IJCAI 2005), pp. 343\u2013350 (2005)"},{"key":"13_CR14","unstructured":"TSPLIB Homepage, \n                  \n                    http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsplib.html"},{"key":"13_CR15","unstructured":"DIMACS Implementation Challenge, \n                  \n                    http:\/\/www.research.att.com\/~dsj\/chtsp\/"},{"key":"13_CR16","unstructured":"National Instances, \n                  \n                    http:\/\/www.tsp.gatech.edu\/world\/summary.html"},{"key":"13_CR17","unstructured":"TSP Homepage, \n                  \n                    http:\/\/www.tsp.gatech.edu\/"},{"key":"13_CR18","unstructured":"VLSI Instances from the TSP Homepage, \n                  \n                    http:\/\/www.tsp.gatech.edu\/vlsi\/summary.html"},{"key":"13_CR19","unstructured":"World-TSP from the TSP Homepage, \n                  \n                    http:\/\/www.tsp.gatech.edu\/world\/"},{"key":"13_CR20","unstructured":"Source Code of [1] (Concorde), \n                  \n                    http:\/\/www.tsp.gatech.edu\/concorde\/index.html"},{"key":"13_CR21","unstructured":"Source Code of [7] (LKH), \n                  \n                    http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH\/"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14355-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:25:07Z","timestamp":1619771107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14355-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143540","9783642143557"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14355-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}