{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:04:05Z","timestamp":1761807845125},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,28]],"date-time":"2013-09-28T00:00:00Z","timestamp":1380326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s12532-013-0059-2","type":"journal-article","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T06:52:48Z","timestamp":1380264768000},"page":"55-75","source":"Crossref","is-referenced-by-count":19,"title":["Deterministic \u201cSnakes and Ladders\u201d Heuristic for the Hamiltonian cycle problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Pouya","family":"Baniasadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Ejov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy A.","family":"Filar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Haythorpe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serguei","family":"Rossomakhine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,28]]},"reference":[{"key":"59_CR1","unstructured":"Applegate, D.L., Bixby, R.B., Chav\u00e1tal, V., Cook, W.J.: Concorde TSP Solver. http:\/\/www.tsp.gatech.edu\/concorde\/index.html (2003)"},{"key":"59_CR2","doi-asserted-by":"crossref","unstructured":"Applegate, D.L., Bixby, R.B., Chav\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)","DOI":"10.1515\/9781400841103"},{"key":"59_CR3","unstructured":"Baniasadi, P., Clancy, K., Ejov, V., Filar, J.A., Haythorpe, M., Rossomakhine, S.: Snakes and Ladders Heuristic-Web Interface. http:\/\/fhcp.edu.au\/slhweb\/ (2012)"},{"key":"59_CR4","volume-title":"The Foster Census","author":"IZ Bouwer","year":"1988","unstructured":"Bouwer, I.Z., Chernoff, W.W., Monson, B., Star, Z.: The Foster Census. Charles Babbage Research Center, Winnipeg (1988)"},{"key":"59_CR5","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: The traveling salesman problem for cubic graphs. In: Dehne, F., Sack, J.R., Smid, M. (eds.) Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 2748. pp. 307\u2013318. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-45078-8_27"},{"key":"59_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood, M.M.: The Traveling Salesman Problem. Oper. Res. 4, 61\u201375 (1956)","journal-title":"Oper. Res."},{"key":"59_CR7","unstructured":"Gutin, G., Punnen, A.P.: Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Boston (2002)"},{"key":"59_CR8","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 Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"59_CR9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.2307\/2319844","volume":"82","author":"R Isaacs","year":"1975","unstructured":"Isaacs, R.: Infinite families of nontrivial trivalent graphs which are not Tait colorable. Am. Math. Monthly 82, 221\u2013239 (1975)","journal-title":"Am. Math. Monthly"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York (1985)","DOI":"10.2307\/2582681"},{"key":"59_CR11","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"key":"59_CR12","first-page":"496","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective Heuristic algorithm for the traveling salesman problem. Oper. Res. 21, 496\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"59_CR13","unstructured":"Royle, G., Conder, M., McKay, B., Dobscanyi, P.: Cubic symmetric graphs (The Foster Census): http:\/\/school.maths.uwa.edu.au\/~gordon\/remote\/foster (2001)"},{"key":"59_CR14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/jgt.3190010110","volume":"1","author":"J Sheehan","year":"1977","unstructured":"Sheehan, J.: Graphs with exactly one hamiltonian circuit. J. Graph Theory 1, 37\u201343 (1977)","journal-title":"J. Graph Theory"},{"key":"59_CR15","unstructured":"TSPLIB. Hamiltonian cycle problem (HCP). http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95 (2008)"},{"key":"59_CR16","unstructured":"Weisstein, E.W.: Generalized Petersen Graph (From MathWorld-A Wolfram Web Resource). http:\/\/mathworld.wolfram.com\/generalizedpetersengraph.html"},{"key":"59_CR17","doi-asserted-by":"crossref","unstructured":"Wormald, N.: Models of random regular graphs. In: Surveys in Combinatorics, pp. 239\u2013298. Cambridge University press, Cambridge (1999)","DOI":"10.1017\/CBO9780511721335.010"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0059-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-013-0059-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-013-0059-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T23:00:22Z","timestamp":1596582022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-013-0059-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,28]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s12532-013-0059-2","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,28]]}}}