{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T11:30:50Z","timestamp":1781177450199,"version":"3.54.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"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":[[2004,3]]},"DOI":"10.1016\/s0167-6377(03)00092-0","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T16:46:44Z","timestamp":1058374004000},"page":"159-166","source":"Crossref","is-referenced-by-count":32,"title":["Worst-case analysis of the subset sum algorithm for bin packing"],"prefix":"10.1016","volume":"32","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(03)00092-0_BIB1","series-title":"Approximation Algorithms for NP-Hard Problems","first-page":"46","article-title":"Approximation algorithms for bin-packing: a survey","author":"Coffman","year":"1997"},{"key":"10.1016\/S0167-6377(03)00092-0_BIB2","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","article-title":"New heuristics for one-dimensional bin-packing","volume":"29","author":"Fleszar","year":"2002","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0167-6377(03)00092-0_BIB3","series-title":"Combinatorial Algorithms","first-page":"39","article-title":"An analysis of some packing algorithms","author":"Garey","year":"1973"},{"key":"10.1016\/S0167-6377(03)00092-0_BIB4","unstructured":"R.L. Graham, Bounds on multiprocessing anomalies and related packing algorithms, Proceedings of the 1972 Spring Joint Computer Conference, Montvale, NJ, 1972, pp. 205\u2013217."},{"key":"10.1016\/S0167-6377(03)00092-0_BIB5","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1080\/095372899232894","article-title":"A new heuristic algorithm for the one-dimensional bin-packing problem","volume":"10","author":"Gupta","year":"1999","journal-title":"Prod. Plan. Control"},{"key":"10.1016\/S0167-6377(03)00092-0_BIB6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","article-title":"Fast algorithms for bin packing","volume":"8","author":"Johnson","year":"1974","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0167-6377(03)00092-0_BIB7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","article-title":"Worst-case performance bounds for simple one-dimensional packing algorithms","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(03)00092-0_BIB8","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s006070050042","article-title":"Dynamic programming revisited","volume":"63","author":"Pferschy","year":"1999","journal-title":"Computing"},{"key":"10.1016\/S0167-6377(03)00092-0_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1999.1034","article-title":"Linear time algorithms for knapsack problems with bounded weights","volume":"33","author":"Pisinger","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/S0167-6377(03)00092-0_BIB10","series-title":"Handbook of Combinatorial Optimization","first-page":"1","article-title":"Knapsack problems","author":"Pisinger","year":"1998"},{"key":"10.1016\/S0167-6377(03)00092-0_BIB11","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s101070050105","article-title":"Computational study of a column generation algorithm for bin packing and cutting stock problems","volume":"86","author":"Vanderbeck","year":"1999","journal-title":"Math. Programming"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000920?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000920?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T12:00:30Z","timestamp":1552824030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637703000920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0167637703000920"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(03)00092-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}