{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:49:28Z","timestamp":1777502968050,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1980,1]]},"DOI":"10.1016\/0305-0548(80)90022-2","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"239-249","source":"Crossref","is-referenced-by-count":150,"title":["Degree-constrained minimum spanning tree"],"prefix":"10.1016","volume":"7","author":[{"given":"Subhash C.","family":"Narula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cesar A.","family":"Ho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(80)90022-2_BIB1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/0305-0548(80)90022-2_BIB2","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the travelling-salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/0305-0548(80)90022-2_BIB3","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/0305-0548(80)90022-2_BIB4","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The travelling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(80)90022-2_BIB5","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The travelling-salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/0305-0548(80)90022-2_BIB6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01585505","article-title":"Improvements of the Held-Karp algorithm for the symmetric travelling-salesman problem","volume":"7","author":"Hansen","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/0305-0548(80)90022-2_BIB7","article-title":"Finding minimum spanning trees with a fixed number of links at a node","author":"Glover","year":"1974"},{"key":"10.1016\/0305-0548(80)90022-2_BIB8","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1093\/comjnl\/10.4.374","article-title":"Spanning tree manipulation and the travelling-salesman problem","volume":"10","author":"Obruca","year":"1968","journal-title":"Comp. J."},{"key":"10.1016\/0305-0548(80)90022-2_BIB9","series-title":"Int. Symp. Math. Programming","article-title":"The compact representation of a rooted tree and the transportation problem","author":"Scions","year":"1964"},{"key":"10.1016\/0305-0548(80)90022-2_BIB10","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1287\/opre.14.4.619","article-title":"Networks and basic solutions","volume":"14","author":"Johnson","year":"1966","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(80)90022-2_BIB11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1287\/trsc.6.2.171","article-title":"The augmented predecessor index method for locating stepping stone paths and assigning dual prices in distribution problems","volume":"6","author":"Glover","year":"1972","journal-title":"Transpn Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054880900222?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054880900222?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:27:57Z","timestamp":1552926477000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054880900222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,1]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1980,1]]}},"alternative-id":["0305054880900222"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(80)90022-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1980,1]]}}}