{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T10:11:34Z","timestamp":1767262294839},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0020-0190(92)90143-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"173-177","source":"Crossref","is-referenced-by-count":8,"title":["A simple 0.5-bounded greedy algorithm for the 0\/1 knapsack problem"],"prefix":"10.1016","volume":"42","author":[{"given":"U.K.","family":"Sarkar","sequence":"first","affiliation":[]},{"given":"P.P.","family":"Chakrabarti","sequence":"additional","affiliation":[]},{"given":"S.","family":"Ghose","sequence":"additional","affiliation":[]},{"given":"S.C.","family":"De Sarkar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90143-J_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(92)90143-J_BIB2","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1984"},{"key":"10.1016\/0020-0190(92)90143-J_BIB3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and subset sum problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90143-J_BIB4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/321864.321873","article-title":"Approximate algorithms for the 0\/1 knapsack problem","volume":"22","author":"Sahni","year":"1975","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290143J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290143J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:18Z","timestamp":1555144038000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290143J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290143J"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90143-j","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}