{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:43Z","timestamp":1759638643654},"reference-count":11,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":[[1997,8]]},"DOI":"10.1016\/s0305-0548(96)00091-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"737-748","source":"Crossref","is-referenced-by-count":6,"title":["An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks"],"prefix":"10.1016","volume":"24","author":[{"given":"Geon","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong X.","family":"Shaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seong-Lyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00091-3_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01585993","article-title":"Optimizing constrained subtrees of trees","volume":"71","author":"Aghezzaf","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/opre.43.1.58","article-title":"A decomposition algorithm for expanding local access telecommunications networks","volume":"43","author":"Balakrishnan","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB3","article-title":"Limited column generation technique for several telecommunications network design problems","author":"Shaw","year":"1993"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB4","article-title":"A depth-first dynamic programming algorithm for the tree knapsack problem","author":"Cho","year":"1994"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.8.1.1","article-title":"On knapsacks, partitions, and a new dynamic programming technique for trees","volume":"8","author":"Johnson","year":"1983","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB7","first-page":"213","article-title":"Algorithms for knapsack problems","volume":"31","author":"Martello","year":"1987","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB8","series-title":"Knapsack Problems","author":"Martello","year":"1990"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB9","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero\u2014one knapsack problem","volume":"28","author":"Balas","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation algorithms for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(96)00091-3_BIB11","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000913?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000913?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T02:28:39Z","timestamp":1555986519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":11,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0305054896000913"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00091-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}