{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T07:54:32Z","timestamp":1717228472641},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2004,2,6]],"date-time":"2004-02-06T00:00:00Z","timestamp":1076025600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program., Ser. A"],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1007\/s10107-003-0497-0","type":"journal-article","created":{"date-parts":[[2004,7,21]],"date-time":"2004-07-21T23:07:11Z","timestamp":1090451231000},"page":"537-559","source":"Crossref","is-referenced-by-count":7,"title":["Extended neighborhood: Definition and characterization"],"prefix":"10.1007","volume":"101","author":[{"given":"James B.","family":"Orlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dushyant","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,2,6]]},"reference":[{"key":"CR1","unstructured":"Aarts, E.M.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. John Wiley, 1997"},{"key":"CR2","first-page":"75","volume":"23","author":"Ahuja","year":"2001","unstructured":"Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Disc. Appl. Math. 23, 75?102 (2001)","journal-title":"Disc. Appl. Math."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s101070050010","volume":"87","author":"Deineko","year":"2000","unstructured":"Deineko, V.G., Woeginger, G.J.: A study of exponential neighborhoods for the traveling salesman problem and the quadratic assignment problem. Math. Program. 87, 519?542 (2000)","journal-title":"Math. Program."},{"key":"CR4","unstructured":"Ergun, O.: New neighborhood search algorithms based on exponentially large neighborhoods. PhD Thesis, Operations Research Center, MIT, Cambridge, Massachusetts, USA, 2001"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyes, R.M.: A linear time heuristic for improving network partitions. ACM IEEE Nineteenth Design Automation Conference Proceedings, IEEE Computer Society, 1982, pp. 175?181","DOI":"10.1145\/800263.809204"},{"key":"CR6","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"Glover","year":"2001","unstructured":"Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction heuristics for the asymmetric TSP. Eur. J. Oper. Res. 129, 555?568 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1057\/palgrave.jors.2600392","volume":"48","author":"Glover","year":"1997","unstructured":"Glover, F., Punnen, A.P.: The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms. J. Oper. Res. Soc. 48, 502?510 (1997)","journal-title":"J. Oper. Res. Soc."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0166-218X(01)00267-0","volume":"119","author":"Gutin","year":"2002","unstructured":"Gutin, G., Yeo, A.: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. Disc. Appl. Math. 119, 107?116 (2002)","journal-title":"Disc. Appl. Math."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"Johnson","year":"6","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: An experimental evaluation; Part 1, graph partitioning. Oper. Res. 37 (6), 865?892 (1989)","journal-title":"Oper. Res."},{"key":"CR11","unstructured":"Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. Gutin and Punnen (eds.), The Traveling Salesman Problem and its Variations, Kluwer Academic Publishers, 2002"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical J. 49, 291?307 (1970)","journal-title":"Bell System Technical J."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"Lawler","year":"1963","unstructured":"Lawler, E.: The quadratic assignment Problem. Manage. Sci. 9, 586?599 (1963)","journal-title":"Manage. Sci."},{"key":"CR14","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982"},{"key":"CR15","unstructured":"Potts, C.N., van de Velde, S.L.: Dynasearch ? Iterative local improvement by dynamic programming: Part 1, The traveling salesman problem. Technical Report, University of Twente, The Netherlands, 1995"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0166-218X(01)00268-2","volume":"119","author":"Punnen","year":"2002","unstructured":"Punnen, A.P., Kabadi, S.N.: Domination analysis of some heuristics for the asymmetric traveling salesman problem. Disc. Appl. Math. 119, 117?128 (2002)","journal-title":"Disc. Appl. Math."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Punnen, A.P., Margot, F., Kabadi, S.N.: TSP heuristics: domination analysis and complexity. Algorithmica, 2002 (accepted)","DOI":"10.1007\/s00453-002-0986-1"},{"key":"CR18","unstructured":"Savage, S.L.: The solution of Disc. linear optimization problems by neighborhood search techniques. PhD Thesis, Department of Computer Science, Yale University, 1973"},{"key":"CR19","unstructured":"Sharma, D.: Cyclic exchange and related neighborhood structures for combinatorial optimization problems. Ph.D. Thesis. Operations Research Center, MIT, Cambridge, MA, 2002"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Voss, S., Martello, S., Roucairol, C., Osman, I.H.: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, 1999","DOI":"10.1007\/978-1-4615-5775-3"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-003-0497-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-003-0497-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-003-0497-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T20:32:58Z","timestamp":1585859578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-003-0497-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2,6]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["497"],"URL":"https:\/\/doi.org\/10.1007\/s10107-003-0497-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,2,6]]}}}