{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T23:41:36Z","timestamp":1695685296910},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s10732-005-3487-y","type":"journal-article","created":{"date-parts":[[2005,10,11]],"date-time":"2005-10-11T12:27:54Z","timestamp":1129033674000},"page":"501-505","source":"Crossref","is-referenced-by-count":3,"title":["Further Extension of the TSP Assign Neighborhood"],"prefix":"10.1007","volume":"11","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3487_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-6377(02)00236-5","volume":"31","author":"R. Ahuja","year":"2003","unstructured":"Ahuja, R., J. Orlin, and D. Sharma. (2003). \u201cA Composite Neighborhood Search Algorithm for the Capacitated Minimum Spanning Tree Problem.\u201d Oper. Res. Lett. 31, 185\u2013194.","journal-title":"Oper. Res. Lett."},{"key":"3487_CR2","doi-asserted-by":"crossref","unstructured":"Balas, E. and N. Simonetti. (2001). \u201cLinear Time Dynamic Programming Algorithms for New Classes of Restricted TSPs: A Computational Study.\u201d INFORMS J. Comput. 13, 56\u201375. The code is currently available from www.contrib.andrew.cmu.edu\/\u223cneils\/tsp\/index.html.","DOI":"10.1287\/ijoc.13.1.56.9748"},{"key":"3487_CR3","unstructured":"Balcazar, J.L., J. Diaz, and J. Gabarro. (1995). Structural Complexity I, EATCS Monographs on Theoretical Computer Science, 2nd ed., Berlin: Springer-Verlag."},{"key":"3487_CR4","volume-title":"Digraphs: Theory, Algorithms and Apllications","author":"J. Bang-Jensen","year":"2000","unstructured":"Bang-Jensen, J. and G. Gutin. (2000). Digraphs: Theory, Algorithms and Apllications. London: Springer-Verlag."},{"key":"3487_CR5","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1287\/moor.23.3.613","volume":"23","author":"R.E. Burkard","year":"1998","unstructured":"Burkard, R.E., V.G. Deineko, and G.J. Woeginger. (1998). \u201cThe Travelling Salesman Problem and the PQ-tree.\u201d Math. Oper. Res. 23, 613\u2013623.","journal-title":"Math. Oper. Res."},{"key":"3487_CR6","doi-asserted-by":"crossref","unstructured":"Deineko, V.G. and G.J. Woeginger. (2000). \u201cA Study of Exponential Neighbourhoods for the Traveling Salesman Problem and the Quadratic Assignment Problem.\u201d Math. Program. Ser. A 87, 519\u2013542.","DOI":"10.1007\/s101070050010"},{"key":"3487_CR7","unstructured":"De Franceschi, R., M. Fischetti, and P. Toth. (2005). \u201cA New ILP-based Refinement Heuristic for Vehicle Routing Problems.\u201d Math. Programming (to appear)."},{"key":"3487_CR8","unstructured":"Ergun, O. and J.B. Orlin. (2005). \u201cDynamic Programming Metodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem.\u201d Submitted. See http:\/\/web.mit.edu\/jorlin\/www\/ working_papers.html."},{"key":"3487_CR9","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., C. Rego, and F. Glover. (2005). \u201cData Structures and Ejection Chains for Solving Large Scale Traveling Salesman Problems.\u201d Europ. J. Oper. Res. 160, 154\u2013171.","journal-title":"Europ. J. Oper. Res."},{"key":"3487_CR10","unstructured":"Gutin, G. (1984). \u201cOn an Approach to Solving the Traveling Salesman Problem.\u201d In Proc. The USSR Conference on System Research (Moscow, USSR), (in Russian), pp. 184\u2013185."},{"key":"3487_CR11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0305-0548(98)00064-1","volume":"26","author":"G. Gutin","year":"1999","unstructured":"Gutin, G. (1999). \u201cExponential Neighborhood Local Search for the Traveling Salesman Problem.\u201d Computers and OR 26, 313\u2013320.","journal-title":"Computers and OR"},{"key":"3487_CR12","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0166-218X(03)00181-1","volume":"129","author":"G. Gutin","year":"2003","unstructured":"Gutin, G. and A. Yeo. (2003). \u201cUpper Bounds on ATSP Neighborhood Size.\u201d Discrete Appl. Math. 129, 533\u2013538.","journal-title":"Discrete Appl. Math."},{"key":"3487_CR13","unstructured":"Gutin, G., A. Yeo, and A. Zverovitch. (2002). \u201cExponential Neighborhoods and Domination Analysis for the TSP.\u201d In G. Gutin and A.P. Punnen (eds.), The Traveling Salesman Problem and its Variations. Dordrecht: Kluwer."},{"key":"3487_CR14","first-page":"191","volume":"22","author":"A.P. Punnen","year":"2001","unstructured":"Punnen, A.P. (2001). \u201cThe Traveling Salesman Problem: New Polynomial Approximation Algorithms and Domination Analysis.\u201d J. Inform. Optim. Sci. 22, 191\u2013206.","journal-title":"J. Inform. Optim. Sci."},{"key":"3487_CR15","unstructured":"Rego, C. and F. Glover. (2002). \u201cLocal Search and Metaheuristics for the Traveling Salesman Problem.\u201d In G. Gutin and A.P. Punnen (eds.), The Traveling Salesman Problem and its Variations. Dordrecht: Kluwer."},{"key":"3487_CR16","unstructured":"Sarvanov, V.I. and N.N. Doroshko. (1981). \u201cThe Approximate Solution of the Traveling Salesman Problem by a Local Algorithm with Scanning Neighborhoods of Factorial Cardinality in Cubic Time.\u201d Software: Algorithms and Programs 31, 11\u201313, Minsk: Math. Institute of the Belorussian Acad. Sci. (in Russian)."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-3487-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-005-3487-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-3487-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:26Z","timestamp":1559256866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-005-3487-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":16,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["3487"],"URL":"https:\/\/doi.org\/10.1007\/s10732-005-3487-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}