{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:50:00Z","timestamp":1773085800213,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0167-6377(92)90065-b","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"65-71","source":"Crossref","is-referenced-by-count":12,"title":["A total-value greedy heuristic for the integer knapsack problem"],"prefix":"10.1016","volume":"12","author":[{"given":"Rajeev","family":"Kohli","sequence":"first","affiliation":[]},{"given":"Ramesh","family":"Krishnamurti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90065-B_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.26.1.1","article-title":"Worst-case analysis of heuristic algorithms","volume":"26","author":"Fisher","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(92)90065-B_BIB2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subsets problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0167-6377(92)90065-B_BIB3","series-title":"Project MAC TR-109","article-title":"Near-optimal bin packing algorithms","author":"Johnson","year":"1973"},{"key":"10.1016\/0167-6377(92)90065-B_BIB4","series-title":"18th Annual Symposium on Foundations of Computer Science","first-page":"206","article-title":"Fast approximation algorithms for knapsack problems","author":"Lawler","year":"1977"},{"key":"10.1016\/0167-6377(92)90065-B_BIB5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.23.2.207","article-title":"When the greedy solution solves a class of knapsack problems","volume":"23","author":"Magazine","year":"1975","journal-title":"Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290065B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290065B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:50:42Z","timestamp":1552902642000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290065B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["016763779290065B"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90065-b","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}