{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:14:12Z","timestamp":1780766052746,"version":"3.54.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6347,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0166-218x(94)00037-e","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"223-253","source":"Crossref","is-referenced-by-count":184,"title":["Ejection chains, reference structures and alternating path methods for traveling salesman problems"],"prefix":"10.1016","volume":"65","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00037-E_BIB1","article-title":"Theory of Graphs and its Applications","author":"Berge","year":"1962"},{"key":"10.1016\/0166-218X(94)00037-E_BIB2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0166-218X(91)90039-Y","article-title":"On the use of augmenting chains in chain packings","volume":"30","author":"De Werra","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)00037-E_BIB3","series-title":"Fast clustering algorithms","author":"Dorndorf","year":"1992"},{"key":"10.1016\/0166-218X(94)00037-E_BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0, 1-vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"10.1016\/0166-218X(94)00037-E_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","article-title":"Matroid intersection","volume":"4","author":"Edmonds","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(94)00037-E_BIB6","article-title":"A parallel tabu search algorithm for large scale traveling salesman problems","author":"Fiechter","year":"1990"},{"issue":"3","key":"10.1016\/0166-218X(94)00037-E_BIB7","first-page":"131","article-title":"A bound escalation method for the solution of integer linear programs","volume":"6","author":"Glover","year":"1964","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"key":"10.1016\/0166-218X(94)00037-E_BIB8","article-title":"Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem","author":"Glover","year":"1991"},{"key":"10.1016\/0166-218X(94)00037-E_BIB9","series-title":"Computer Science in Operations Research: New Developments in Their Interfaces","first-page":"491","article-title":"New ejection chain and alternating path methods for traveling salesman problems","author":"Glover","year":"1992"},{"key":"10.1016\/0166-218X(94)00037-E_BIB10","series-title":"Ejection chains and combinatorial leverage for traveling salesman problems","author":"Glover","year":"1992"},{"key":"10.1016\/0166-218X(94)00037-E_BIB11","series-title":"The traveling salesman problem: Linear time heuristics with exponential combinatorial leverage","author":"Glover","year":"1994"},{"key":"10.1016\/0166-218X(94)00037-E_BIB12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BF02078647","article-title":"A user's guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0166-218X(94)00037-E_BIB13","series-title":"The Traveling Salesman Problem","first-page":"207","article-title":"Empirical analysis of heuristics","author":"Golden","year":"1985"},{"key":"10.1016\/0166-218X(94)00037-E_BIB14","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","article-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(94)00037-E_BIB15","article-title":"Ejection chain methods and tabu search for clustering","author":"Hubscher","year":"1992"},{"key":"10.1016\/0166-218X(94)00037-E_BIB16","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","article-title":"Tabu search for the multilevel generalized assignment problem","volume":"82","author":"Laguna","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(94)00037-E_BIB17","article-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(94)00037-E_BIB18","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/0166-218X(94)00037-E_BIB19","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)00037-E_BIB20","series-title":"Linkages With Artificial Intelligence","first-page":"59","article-title":"Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem","volume":"21","author":"Malek","year":"1989"},{"key":"10.1016\/0166-218X(94)00037-E_BIB21","unstructured":"E. Pesch. Personal communications, 1991."},{"key":"10.1016\/0166-218X(94)00037-E_BIB22","article-title":"Reference structures, neighborhoods and candidate lists for TSP ejection chains","author":"Pesch","year":"1993"},{"key":"10.1016\/0166-218X(94)00037-E_BIB23","article-title":"Une heuristic tabou avec structures de voisinage compos\u00e9 pour les tourn\u00e9es de vehicules","author":"Rego","year":"1993"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400037E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400037E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:22:42Z","timestamp":1555575762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400037E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0166218X9400037E"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00037-e","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}