{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T15:44:52Z","timestamp":1769355892032,"version":"3.49.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,8,1]],"date-time":"1980-08-01T00:00:00Z","timestamp":333936000000},"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":[[1980,8]]},"DOI":"10.1016\/0020-0190(80)90031-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"37-39","source":"Crossref","is-referenced-by-count":27,"title":["An improved BL lower bound"],"prefix":"10.1016","volume":"11","author":[{"given":"Donna J.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(80)90031-9_BIB1","unstructured":"B.S. Baker, D.J. Brown and H.P. Katseff, A 54 algorithm for two-dimensional bin packing, in preparation."},{"key":"10.1016\/0020-0190(80)90031-9_BIB2","doi-asserted-by":"crossref","unstructured":"B.S. Baker, E.G. Coffman and R.L. Rivest, Orthogonal packings in two dimensions, SIAM J. Comput., to appear.","DOI":"10.1137\/0209064"},{"key":"10.1016\/0020-0190(80)90031-9_BIB3","author":"Baker","year":"1979"},{"key":"10.1016\/0020-0190(80)90031-9_BIB4","series-title":"Technical Report","article-title":"Lower bounds for on-line two-dimensional packing algorithms","author":"Brown","year":"1980"},{"key":"10.1016\/0020-0190(80)90031-9_BIB5","author":"Coffman","year":"1979","journal-title":"Performance bounds for level-oriented two dimensional packing algorithms"},{"key":"10.1016\/0020-0190(80)90031-9_BIB6","author":"Golan","year":"1978","journal-title":"Orthogonal oriented algorithms for packing in two dimensions"},{"key":"10.1016\/0020-0190(80)90031-9_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(80)90031-9_BIB8","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\/0020-0190(80)90031-9_BIB9","author":"Storer","year":"1979","journal-title":"An improved lower bound for on-line packing with decreasing width"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019080900319?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019080900319?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:51:58Z","timestamp":1555059118000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019080900319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,8]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,8]]}},"alternative-id":["0020019080900319"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(80)90031-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1980,8]]}}}