{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:04:15Z","timestamp":1778493855813,"version":"3.51.4"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8417,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,7]]},"DOI":"10.1016\/0166-218x(90)90094-s","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:02:11Z","timestamp":1027638131000},"page":"59-70","source":"Crossref","is-referenced-by-count":213,"title":["Lower bounds and reduction procedures for the bin packing problem"],"prefix":"10.1016","volume":"28","author":[{"given":"Silvano","family":"Martello","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90094-S_BIB1","series-title":"Algorithm Design for Computer System Design","article-title":"Approximation algorithms for bin-packing\u2014An updated survey","author":"Coffman","year":"1984"},{"key":"10.1016\/0166-218X(90)90094-S_BIB2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.17.5.259","article-title":"The loading problem","volume":"17","author":"Eilon","year":"1971","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90094-S_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(90)90094-S_BIB4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/nav.3800250209","article-title":"An algorithm for a class of loading problems","volume":"25","author":"Hung","year":"1978","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(90)90094-S_BIB5","series-title":"Doctoral Thesis","article-title":"Near-optimal bin packing algorithms","author":"Johnson","year":"1973"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090094S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090094S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T19:53:30Z","timestamp":1555185210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090094S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["0166218X9090094S"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90094-s","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}