{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:29:55Z","timestamp":1710347395879},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":[[1993,11]]},"DOI":"10.1016\/0167-6377(93)90072-o","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"215-220","source":"Crossref","is-referenced-by-count":10,"title":["Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems"],"prefix":"10.1016","volume":"14","author":[{"given":"Tsung-Chyan","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(93)90072-O_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"Worst-case analysis of heuristic algorithms","volume":"27","author":"Fisher","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(93)90072-O_BIB2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02591687","article-title":"Worst-case analysis of the differencing method for the partition problem","volume":"37","author":"Fischetti","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(93)90072-O_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(93)90072-O_BIB4","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reductibility among Combinatorial Problems","author":"Karp","year":"1972"},{"key":"10.1016\/0167-6377(93)90072-O_BIB5","article-title":"Two NP-complete problems in nonnegative integer programming","author":"Lueker","year":"1975"},{"key":"10.1016\/0167-6377(93)90072-O_BIB6","series-title":"Knapsack Problems","author":"Martello","year":"1990"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390072O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390072O?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:52:12Z","timestamp":1552902732000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779390072O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["016763779390072O"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(93)90072-o","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}