{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T09:33:47Z","timestamp":1774690427555,"version":"3.50.1"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319670768","type":"print"},{"value":"9783319670775","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67077-5_5","type":"book-chapter","created":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T01:42:47Z","timestamp":1504662167000},"page":"45-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Simulated Annealing for Finding TSP Lower Bound"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Str\u0105k","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Wieczorek","sequence":"additional","affiliation":[]},{"given":"Arkadiusz","family":"Nowakowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,7]]},"reference":[{"key":"5_CR1","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.: Eur. J. Oper. Res. 126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1287\/moor.16.1.72","volume":"16","author":"MX Goemans","year":"1991","unstructured":"Goemans, M.X., Bertsimas, D.J.: Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem. Math. Oper. Res. 16(1), 72\u201389 (1991)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0377-2217(96)00214-7","volume":"102","author":"CL Valenzuela","year":"1997","unstructured":"Valenzuela, C.L., Jones, A.J.: Estimating the Held-Karp lower bound for the geometric TSP. Eur. J. Oper. Res. 102(1), 157\u2013175 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR4","unstructured":"Johnson, D.S., McGeoch, L.A., Rothberg, E.E.: Asymptotic experimental analysis for the Held-Karp traveling salesman bound. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996, Philadelphia, PA, USA, pp. 341\u2013350. Society for Industrial and Applied Mathematics (1996)"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.orl.2005.04.010","volume":"34","author":"A Westerlund","year":"2006","unstructured":"Westerlund, A., G\u00f6the-Lundgren, M., Larsson, T.: A note on relatives to the Held and Karp 1-tree problem. Oper. Res. Lett. 34(3), 275\u2013282 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"RM Karp","year":"1970","unstructured":"Karp, R.M., Held, M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1), 6\u201325 (1971)","journal-title":"Math. Program."},{"issue":"1","key":"5_CR8","first-page":"33","volume":"174","author":"BT Polyak","year":"1967","unstructured":"Polyak, B.T.: A general method of solving extremum problems. Dokl. Akad. Nauk SSSR 174(1), 33 (1967)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"5_CR9","unstructured":"Helsgaun, K.: An effective implementation of k-opt moves for the Lin-Kernighan TSP heuristic. Technical report, Roskilde University (2006)"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67077-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:33:17Z","timestamp":1710264797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-67077-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319670768","9783319670775"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67077-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"7 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}