{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T17:24:51Z","timestamp":1744133091513},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":[[2001,8]]},"DOI":"10.1016\/s0167-6377(01)00076-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:37:03Z","timestamp":1027615023000},"page":"13-16","source":"Crossref","is-referenced-by-count":13,"title":["A polynomially solvable special case of the unbounded knapsack problem"],"prefix":"10.1016","volume":"29","author":[{"given":"Moshe","family":"Zukerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy","family":"Neame","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00076-1_BIB1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/opre.24.1.193","article-title":"Optimality of a heuristic solution for a class of knapsack problems","volume":"24","author":"Hu","year":"1976","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00076-1_BIB2","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0167-6377(01)00076-1_BIB3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00076-1_BIB4","unstructured":"G.S. Lueker, Two NP-Complete Problems in Nonnegative Integer Programming, Report No. 178, Computer Science Laboratory, Princeton University, 1975."},{"key":"10.1016\/S0167-6377(01)00076-1_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."},{"key":"10.1016\/S0167-6377(01)00076-1_BIB6","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0167-6377(01)00076-1_BIB7","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000761?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000761?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T21:52:34Z","timestamp":1556229154000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0167637701000761"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00076-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}