{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:34:23Z","timestamp":1777372463340,"version":"3.51.4"},"reference-count":5,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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":[[2000,2]]},"DOI":"10.1016\/s0020-0190(00)00010-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:53:01Z","timestamp":1027623181000},"page":"111-118","source":"Crossref","is-referenced-by-count":35,"title":["A PTAS for the Multiple Subset Sum Problem with different knapsack capacities"],"prefix":"10.1016","volume":"73","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Kellerer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00010-7_ID005","series-title":"The Multiple Subset Sum Problem","author":"Caprara","year":"1998"},{"key":"10.1016\/S0020-0190(00)00010-7_ID006","series-title":"Approximation algorithms for the multiple knapsack problem with assignment restrictions","author":"Dawande","year":"1998"},{"key":"10.1016\/S0020-0190(00)00010-7_ID007","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","article-title":"Bin packing can be solved within 1+\u03b5 in linear time","volume":"Vol. 1","author":"Fernandez de la Vega","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(00)00010-7_ID008","series-title":"Proc. APPROX 99","article-title":"A polynomial approximation scheme for the multiple knapsack problem","author":"Kellerer","year":"1999"},{"key":"10.1016\/S0020-0190(00)00010-7_ID009","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":"Vol. 8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T08:24:57Z","timestamp":1556007897000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":5,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0020019000000107"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00010-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}