{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:30:30Z","timestamp":1773930630063,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T00:00:00Z","timestamp":1457654400000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10479-016-2159-7","type":"journal-article","created":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T09:28:21Z","timestamp":1457688501000},"page":"583-601","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A k-level data structure for large-scale traveling salesman problems"],"prefix":"10.1007","volume":"244","author":[{"given":"Colin","family":"Osterman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9sar","family":"Rego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,11]]},"reference":[{"issue":"7","key":"2159_CR1","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/mnsc.43.7.908","volume":"43","author":"B Cao","year":"1997","unstructured":"Cao, B., & Glover, F. (1997). Tabu search and ejection chains\u2014application to a node weighted version of the cardinality-constrained TSP. Management Science, 43(7), 908\u2013921.","journal-title":"Management Science"},{"key":"2159_CR2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0304-3975(90)90053-K","volume":"71","author":"M Chrobak","year":"1990","unstructured":"Chrobak, M., Szymacha, T., & Krawczyk, A. (1990). A data structure useful for finding Hamiltonian cycles. Theoretical Computer Science, 71, 419\u2013424.","journal-title":"Theoretical Computer Science"},{"key":"2159_CR3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1006\/jagm.1995.1018","volume":"18","author":"M Fredman","year":"1995","unstructured":"Fredman, M., Johnson, D., McGeoch, L., & Ostheimer, G. (1995). Data structures for traveling salesmen. Journal of Algorithms, 18, 423\u2013479.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"2159_CR4","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ejor.2004.04.023","volume":"160","author":"D Gamboa","year":"2005","unstructured":"Gamboa, D., Rego, C., & Glover, F. (2005). Data structures and ejection chains for solving large-scale traveling salesman problems. European Journal of Operational Research, 160(1), 154\u2013171.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2159_CR5","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1016\/j.cor.2005.06.014","volume":"33","author":"D Gamboa","year":"2006","unstructured":"Gamboa, D., Rego, C., & Glover, F. (2006). Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Computers and Operations Research, 33(4), 1154\u20131172.","journal-title":"Computers and Operations Research"},{"key":"2159_CR6","first-page":"449","volume":"1992","author":"F Glover","year":"1992","unstructured":"Glover, F. (1992). New ejection chain and alternating path methods for traveling salesman problems. Computer Science and Operations Research, 1992, 449\u2013509.","journal-title":"Computer Science and Operations Research"},{"key":"2159_CR7","unstructured":"Johnson, D., McGeogh, L., Glover, F., & Rego, C. (2000) 8th DIMACS implementation challenge: The traveling salesman problem. dimacs.rutgers.edu\/Challenges\/TSP\/"},{"key":"2159_CR8","volume-title":"The art of computer programming, v.1: Fundamental algorithms","author":"D Knuth","year":"1968","unstructured":"Knuth, D. (1968). The art of computer programming, v.1: Fundamental algorithms. Reading: Addison-Wesley."},{"key":"2159_CR9","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. (1965). Computer solutions of the traveling salesman problem. Bell System Computer Journal, 44, 2245\u20132269.","journal-title":"Bell System Computer Journal"},{"key":"2159_CR10","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., & Kernighan, B. (1973). An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21, 498\u2013516.","journal-title":"Operations Research"},{"issue":"1\u20133","key":"2159_CR11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","volume":"76","author":"E Pesch","year":"1997","unstructured":"Pesch, E., & Glover, F. (1997). TSP ejection chains. Discrete Applied Mathematics, 76(1\u20133), 165\u2013181.","journal-title":"Discrete Applied Mathematics"},{"key":"2159_CR12","unstructured":"Punnen, A. P., & Glover, F. (1999). Ejection chains and combinatorial leverage for the traveling salesman problem. Research Report."},{"key":"2159_CR13","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0377-2217(97)00288-9","volume":"106","author":"C Rego","year":"1998","unstructured":"Rego, C. (1998). Relaxed tours and path ejections for the traveling salesman problem. European Journal of Operational Research, 106, 522\u2013538.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"2159_CR14","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1287\/mnsc.44.10.1447","volume":"44","author":"C Rego","year":"1998","unstructured":"Rego, C. (1998). A subpath ejection method for the vehicle routing problem. Management Science, 44(10), 1447\u20131459.","journal-title":"Management Science"},{"issue":"3","key":"2159_CR15","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D Sleator","year":"1985","unstructured":"Sleator, D., & Tarjan, R. (1985). Self-adjusting binary search trees. Journal of the ACM, 32(3), 652\u2013686.","journal-title":"Journal of the ACM"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2159-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2159-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2159-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2159-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:20Z","timestamp":1559138960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2159-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,11]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["2159"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2159-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,11]]}}}