{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:23:20Z","timestamp":1759134200751},"reference-count":9,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0167-8191(02)00150-3","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T12:54:12Z","timestamp":1034168052000},"page":"1501-1505","source":"Crossref","is-referenced-by-count":12,"title":["Comments on parallel algorithms for the knapsack problem"],"prefix":"10.1016","volume":"28","author":[{"given":"Carlos Alberto Alonso","family":"Sanches","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nei Yoshihiro","family":"Soma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horacio Hideki","family":"Yanasse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00150-3_BIB1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0167-8191(94)90083-3","article-title":"A parallel algorithm for the knapsack problem using a generation and searching technique","author":"Chang","year":"1994","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(02)00150-3_BIB2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0304-3975(89)90027-3","article-title":"Complexity of selection in X+Y","volume":"67","author":"Cosnard","year":"1989","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0167-8191(02)00150-3_BIB3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(93)90295-5","article-title":"On space-efficient algorithms for certain NP-complete problems","volume":"120","author":"Ferreira","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0167-8191(02)00150-3_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jpdc.1996.0150","article-title":"Fast and scalable parallel algorithms for knapsack-like problems","volume":"39","author":"Ferreira","year":"1996","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"10.1016\/S0167-8191(02)00150-3_BIB5","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 ACM"},{"key":"10.1016\/S0167-8191(02)00150-3_BIB6","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/TC.1984.1676456","article-title":"A parallel algorithm for the knapsack problem","volume":"C-33","author":"Karnin","year":"1984","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0167-8191(02)00150-3_BIB7","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0167-8191(96)00085-3","article-title":"A parallel two-list algorithm for the knapsack problem","author":"Lou","year":"1997","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(02)00150-3_BIB8","unstructured":"C.A.A. Sanches, N.Y. Soma, H.H. Yanasse, An adaptive optimal parallel two-list algorithm for the knapsack problem, submitted to Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(02)00150-3_BIB9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(87)90056-9","article-title":"An O(nlogk2n\/2) time and O(k2n\/k) space algorithms for certain NP-complete problems","volume":"51","author":"Vyskoc","year":"1987","journal-title":"Theoretical Computer Science"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102001503?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102001503?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T03:59:35Z","timestamp":1554782375000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819102001503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":9,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0167819102001503"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00150-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}