{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:37:52Z","timestamp":1765355872118},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,11,28]],"date-time":"2014-11-28T00:00:00Z","timestamp":1417132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s11590-014-0828-5","type":"journal-article","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T15:17:24Z","timestamp":1417533444000},"page":"1247-1254","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances"],"prefix":"10.1007","volume":"9","author":[{"given":"Holger H.","family":"Hoos","sequence":"first","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,28]]},"reference":[{"key":"828_CR1","unstructured":"The traveling salesman problem. Version visited last on 15 April 2014. http:\/\/www.math.uwaterloo.ca\/tsp\/ (2014)"},{"key":"828_CR2","unstructured":"Applegate, D.: Personal communication (2009)"},{"key":"828_CR3","volume-title":"The traveling salesman problem: a computational study","author":"D Applegate","year":"2006","unstructured":"Applegate, D., Bixby, R.E., Chvatal, V., Cook, W.J.: The traveling salesman problem: a computational study. Princeton University Press, Princeton (2006)"},{"key":"828_CR4","unstructured":"Applegate, D., Bixby, R.E., Chvatal, V., Cook, W.J.: Concorde TSP solver. Version visited last on 15 April 2014. http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html (2014)"},{"key":"828_CR5","unstructured":"Beame, P., Pitassi, T.: Propositional proof complexity: past, present, and future. In: Current trends in theoretical computer science: entering the 21st century, pp. 42\u201370. World Scientific Publishing (2001)"},{"issue":"3","key":"828_CR6","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1287\/moor.1050.0151","volume":"30","author":"S Dash","year":"2005","unstructured":"Dash, S.: Exponential lower bounds on the lengths of some classes of branch-and-cut proofs. Math. Oper. Res. 30(3), 678\u2013700 (2005)","journal-title":"Math. Oper. Res."},{"key":"828_CR7","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"2\u20133","key":"828_CR8","doi-asserted-by":"crossref","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. Math. Program. Comput. 1(2\u20133), 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"828_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ejor.2014.03.042","volume":"238","author":"HH Hoos","year":"2014","unstructured":"Hoos, H.H., St\u00fctzle, T.: On the empirical scaling of run-time for finding optimal solutions to the traveling salesman problem. Eur. J. Oper. Res. 238(1), 87\u201394 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"828_CR10","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan., A.H.G, Shmoys, D.B.: The traveling salesman problem. Wiley, Chichester (1985)"},{"issue":"2","key":"828_CR11","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2), 346\u2013363 (2013)","journal-title":"INFORMS J. Comput."},{"key":"828_CR12","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.artint.2010.10.002","volume":"175","author":"K Pipatsrisawat","year":"2011","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers as resolution engines. Artif. Intell. 175, 512\u2013525 (2011)","journal-title":"Artif. Intell."},{"key":"828_CR13","unstructured":"Reinelt, G.: The traveling salesman: computational solutions for TSP applications. Lecture Notes in Computer Science, vol. 840. Springer, Heidelberg, Germany (1994)"},{"key":"828_CR14","unstructured":"Reinelt, G.: TSPLIB. Version visited last on 15 June 2012, http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95 (2012)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0828-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0828-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0828-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:41Z","timestamp":1559409101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0828-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,28]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["828"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0828-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,28]]}}}