{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:26:13Z","timestamp":1774599973888,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":[[1992,10]]},"DOI":"10.1016\/0020-0190(92)90223-i","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"277-284","source":"Crossref","is-referenced-by-count":153,"title":["An improved lower bound for on-line bin packing algorithms"],"prefix":"10.1016","volume":"43","author":[{"given":"Andr\u00e9","family":"van Vliet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90223-I_BIB1","series-title":"Computer and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(92)90223-I_BIB2","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1137\/0607041","article-title":"Parametric lower bound for on-line bin packing","volume":"7","author":"Galambos","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0020-0190(92)90223-I_BIB3","first-page":"121","article-title":"Notes on Lee's harmonic fit algorithm","volume":"9","author":"Galambos","year":"1988","journal-title":"Ann. Univ. Sci. Budapest. Sect. Comput."},{"key":"10.1016\/0020-0190(92)90223-I_BIB4","unstructured":"G. Galambos and J.B.G. Frenk, A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case, Submitted for publication."},{"key":"10.1016\/0020-0190(92)90223-I_BIB5","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","article-title":"A simple on-line bin packing algorithm","volume":"32","author":"Lee","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90223-I_BIB6","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0020-0190(80)90077-0","article-title":"A lower bound for on-line bin packing","volume":"10","author":"Liang","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90223-I_BIB7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","article-title":"On-line bin packing in linear time","volume":"10","author":"Ramanan","year":"1989","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290223I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290223I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:28Z","timestamp":1555129708000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290223I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["002001909290223I"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90223-i","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}