{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:29:17Z","timestamp":1760383757265},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":[[2002,4]]},"DOI":"10.1016\/s0167-6377(02)00118-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"83-88","source":"Crossref","is-referenced-by-count":6,"title":["A bin packing problem with over-sized items"],"prefix":"10.1016","volume":"30","author":[{"given":"Wenxun","family":"Xing","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00118-9_BIB1","unstructured":"E.G. Coffman Jr., M.R. Garey, D.S. Johnson, Approximation algorithms for bin packing problems: an updated survey, in: Ausiello, Lucer-tini (Eds.), Analysis and Design of Algorithms in Combinatorial Optimization, Springer, New York, 1984, pp. 49\u2013106."},{"key":"10.1016\/S0167-6377(02)00118-9_BIB2","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","article-title":"Variable-sized bin packing","volume":"15","author":"Friesen","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(02)00118-9_BIB3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01415672","article-title":"On-line bin packing\u2014a restricted survey","volume":"42","author":"Galambos","year":"1995","journal-title":"ZOR-Math. Methods Oper. Res."},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0167-6377(02)00118-9_BIB4"},{"key":"10.1016\/S0167-6377(02)00118-9_BIB5","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(02)00118-9_BIB6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0216012","article-title":"An efficient approximation scheme for variable-sized bin packing","volume":"16","author":"Murgolo","year":"1987","journal-title":"SIAM J. Comput."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001189?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001189?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T12:24:53Z","timestamp":1555158293000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0167637702001189"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00118-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"type":"print","value":"0167-6377"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}