{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:55:49Z","timestamp":1769972149268,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":4125,"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":[[2002,4]]},"DOI":"10.1016\/s0166-218x(01)00255-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"43-54","source":"Crossref","is-referenced-by-count":79,"title":["Variable neighborhood search for the degree-constrained minimum spanning tree problem"],"prefix":"10.1016","volume":"118","author":[{"given":"Celso C.","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Maur\u0131\u0301cio C.","family":"Souza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00255-4_BIB1","series-title":"Foundations of Computer Science, Vol. I","author":"Aho e","year":"1992"},{"key":"10.1016\/S0166-218X(01)00255-4_BIB2","first-page":"16","article-title":"Enhancements of spanning tree labelling procedures for network optimization","volume":"17","author":"Barr","year":"1979","journal-title":"INFOR"},{"key":"10.1016\/S0166-218X(01)00255-4_BIB3","series-title":"Metaheuristics: Theory and Applications","article-title":"Comparison of heuristic algorithms for the degree constrained spanning tree","author":"Craig","year":"1996"},{"key":"10.1016\/S0166-218X(01)00255-4_BIB4","unstructured":"A. Ernst, M. Krishnamoorthy, personal communications, 1999\/2000."},{"key":"10.1016\/S0166-218X(01)00255-4_BIB5","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\/S0166-218X(01)00255-4_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00255-4_BIB7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","article-title":"Topological design of centralized networks: formulations and algorithms","volume":"12","author":"Gavish","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00255-4_BIB8","first-page":"433","article-title":"Recent developments in computer implementation technology for network flow algorithms","volume":"20","author":"Glover","year":"1982","journal-title":"INFOR"},{"key":"10.1016\/S0166-218X(01)00255-4_BIB9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0377-2217(92)90317-3","article-title":"An indepth empirical investigation of non-greedy approaches for the minimum spanning tree problem","volume":"56","author":"Glover","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00255-4_BIB10","series-title":"Metaheuristics: Advances and Trends in Local Search Procedures for Optimization","first-page":"433","article-title":"An introduction to variable neighbourhood search","author":"Hansen","year":"1999"},{"key":"10.1016\/S0166-218X(01)00255-4_BIB11","unstructured":"M. Krishnamoorthy, A.T. Ernst, Y.M. Sharaiha, Comparison of algorithms for the degree constrained spanning tree, J. Heuristics 1997, submitted for publication."},{"key":"10.1016\/S0166-218X(01)00255-4_BIB12","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighbourhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00255-4_BIB13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","article-title":"Degree-constrained minimum spanning tree","volume":"7","author":"Narula","year":"1980","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00255-4_BIB14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0305-0548(85)90032-2","article-title":"Edge exchanges in the degree-constrained minimum spanning tree problem","volume":"12","author":"Savelsbergh","year":"1985","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00255-4_BIB15","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/355826.355828","article-title":"A more portable Fortran random number generator","volume":"5","author":"Schrage","year":"1979","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0166-218X(01)00255-4_BIB16","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0377-2217(89)90169-0","article-title":"A Lagrangean approach to the DCMST problem","volume":"39","author":"Volgenant","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00255-4_BIB17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F","article-title":"A note on genetic algorithms for the degree-constrained spanning tree problem","volume":"30","author":"Zhou","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00255-4_BIB18","first-page":"157","article-title":"Approach to degree-constrained minimum spanning tree problem using genetic algorithm","volume":"3","author":"Zhou","year":"1997","journal-title":"Eng. Desing Automat."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002554?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002554?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:57:17Z","timestamp":1556776637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0166218X01002554"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00255-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}