{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:31:57Z","timestamp":1760819517521},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-6377(02)00236-5","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T19:16:29Z","timestamp":1048619789000},"page":"185-194","source":"Crossref","is-referenced-by-count":62,"title":["A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem"],"prefix":"10.1016","volume":"31","author":[{"given":"Ravindra K.","family":"Ahuja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James B.","family":"Orlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dushyant","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00236-5_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/S0167-6377(02)00236-5_BIB2","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0167-6377(02)00236-5_BIB3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","article-title":"Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem","volume":"91","author":"Ahuja","year":"2001","journal-title":"Math. Program."},{"key":"10.1016\/S0167-6377(02)00236-5_BIB4","first-page":"9","article-title":"Capacitated minimum spanning trees","volume":"1","author":"Amberg","year":"1996","journal-title":"Combin. Optim. Theory Practice"},{"key":"10.1016\/S0167-6377(02)00236-5_BIB5","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1147\/sj.53.0142","article-title":"On teleprocessing system design. Part II\u2014a method for approximating the optimal network","volume":"5","author":"Esau","year":"1966","journal-title":"IBM Systems J."},{"key":"10.1016\/S0167-6377(02)00236-5_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"J. Global Optim."},{"key":"10.1016\/S0167-6377(02)00236-5_BIB7","doi-asserted-by":"crossref","unstructured":"P. Festa, M.G.C. Resende, GRASP: an annotated bibliography, in: P. Hansen, C.C. Ribeiro (Eds.) Essays and Surveys on Metaheuristics, Kluwer Scientific Publishers, MA, 2001, pp. 325\u2013367.","DOI":"10.1007\/978-1-4615-1507-4_15"},{"key":"10.1016\/S0167-6377(02)00236-5_BIB8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02061657","article-title":"Topological design telecommunications networks\u2014local access design methods","volume":"33","author":"Gavish","year":"1991","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00236-5_BIB9","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0167-6377(02)00236-5_BIB10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1018911003529","article-title":"The capacitated minimum spanning tree","volume":"86","author":"Gouveia","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00236-5_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1097-0037(200001)35:1<1::AID-NET1>3.0.CO;2-L","article-title":"A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem","volume":"35","author":"Gouveia","year":"2000","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(02)00236-5_BIB12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F","article-title":"A tabu search algorithm for the capacitated shortest spanning tree problem","volume":"29","author":"Sharaiha","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0167-6377(02)00236-5_BIB13","unstructured":"P.M. Thompson, J.B. Orlin, The theory of cyclic transfers, Working Paper OR200-89, Operations Research Center, MIT, Cambridge, MA, 1989."},{"key":"10.1016\/S0167-6377(02)00236-5_BIB14","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","article-title":"Cyclic transfer algorithms for multi-vehicle routing and scheduling problems","volume":"41","author":"Thompson","year":"1993","journal-title":"Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702002365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702002365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T04:04:10Z","timestamp":1583985850000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702002365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167637702002365"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00236-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}