{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:42Z","timestamp":1757629482713,"version":"3.44.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0743-7315(91)90080-s","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"332-337","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":29,"title":["Processor-efficient hypercube algorithms for the knapsack problem"],"prefix":"10.1016","volume":"13","author":[{"given":"Jianhua","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James A.","family":"Storer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1962","series-title":"Applied Dynamic Programming","author":"Bellman","key":"10.1016\/0743-7315(91)90080-S_BIB1"},{"year":"1989","series-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","key":"10.1016\/0743-7315(91)90080-S_BIB2"},{"issue":"4","key":"10.1016\/0743-7315(91)90080-S_BIB3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF00940421","article-title":"Dynamic programming and parallel computers","volume":"12","author":"Casti","year":"1973","journal-title":"J. Optim. Theory Appl."},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/0743-7315(91)90080-S_BIB4"},{"issue":"4","key":"10.1016\/0743-7315(91)90080-S_BIB5","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1145\/322276.322285","article-title":"Dynamic programming as graph searching: An algebraic approach","volume":"28","author":"Gensi","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0743-7315(91)90080-S_BIB6","series-title":"Proc. International Conference on Parallel Processing","first-page":"444","article-title":"Parallel approximate algorithms for the 0-1 knapsack problem","author":"Gopalakrishnan","year":"1986"},{"year":"1985","series-title":"The Connection Machine","author":"Hillis","key":"10.1016\/0743-7315(91)90080-S_BIB7"},{"year":"1978","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","key":"10.1016\/0743-7315(91)90080-S_BIB8"},{"issue":"4","key":"10.1016\/0743-7315(91)90080-S_BIB9","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":"Math. Oper. Res."},{"key":"10.1016\/0743-7315(91)90080-S_BIB10","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/0743-7315(88)90007-X","article-title":"A hypercube algorithm for the 0\/1 knapsack problem","volume":"5","author":"Lee","year":"1988","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(91)90080-S_BIB11","series-title":"Proc. International Conference on Parallel Processing","first-page":"434","article-title":"Systolic processing for dynamic programming problems","author":"Li","year":"1985"},{"key":"10.1016\/0743-7315(91)90080-S_BIB12","series-title":"Proc. International Conference on Parallel Processing","first-page":"917","article-title":"Delta transformations to simplify VLSI processor arrays for serial dynamic programming","author":"Lipton","year":"1986"},{"key":"10.1016\/0743-7315(91)90080-S_BIB13","series-title":"Proc. International Conference on Fifth Generation Computer Systems","first-page":"542","article-title":"Parallel approximation algorithms","author":"Mayr","year":"1988"},{"issue":"4","key":"10.1016\/0743-7315(91)90080-S_BIB14","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.24.4.611","article-title":"Branch-and-bound strategies for dynamic programming","volume":"24","author":"Morin","year":"1976","journal-title":"Oper. Res."},{"key":"10.1016\/0743-7315(91)90080-S_BIB15","series-title":"22nd Annual Allerton Conference on Communication, Control, and Computing","first-page":"671","article-title":"Parallel approximation schemes for subset sum and knapsack problems","author":"Peters","year":"1984"},{"year":"1983","series-title":"Discrete Optimization Algorithms","author":"Syslo","key":"10.1016\/0743-7315(91)90080-S_BIB16"},{"key":"10.1016\/0743-7315(91)90080-S_BIB17","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/0743-7315(90)90139-G","article-title":"Adaptive parallel algorithms for integral knapsack problems","volume":"8","author":"Teng","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(91)90080-S_BIB18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/MC.1985.1662926","article-title":"Multiprocessing of combinatorial search problems","volume":"18","author":"Wah","year":"1985","journal-title":"Computer"},{"issue":"1","key":"10.1016\/0743-7315(91)90080-S_BIB19","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/MC.1987.1663362","article-title":"Applications of the connection machine","volume":"20","author":"Waltz","year":"1987","journal-title":"Computer"},{"key":"10.1016\/0743-7315(91)90080-S_BIB20","series-title":"13th Annual ACM Symposium on Theory of Computing","first-page":"123","article-title":"On the parallel computation for the knapsack problem","author":"Yao","year":"1981"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190080S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190080S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:27Z","timestamp":1757514627000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190080S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["074373159190080S"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90080-s","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Processor-efficient hypercube algorithms for the knapsack problem","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90080-S","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}