{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:18:15Z","timestamp":1773778695589,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"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":3364,"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":[[2004,5]]},"DOI":"10.1016\/j.dam.2003.08.004","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T08:02:59Z","timestamp":1068105779000},"page":"241-258","source":"Crossref","is-referenced-by-count":37,"title":["New lower bounds for the three-dimensional finite bin packing problem"],"prefix":"10.1016","volume":"140","author":[{"given":"Marco A.","family":"Boschetti","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2003.08.004_BIB1","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","article-title":"Two dimensional finite bin packing algorithms","volume":"38","author":"Berkey","year":"1987","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.dam.2003.08.004_BIB2","series-title":"Handbook of Combinatorial Optimization","article-title":"Bin packing approximation algorithms: combinatorial analysis","author":"Coffman","year":"1999"},{"key":"10.1016\/j.dam.2003.08.004_BIB3","series-title":"Approximation Algorithms for NP-Hard Problems","article-title":"Approximation algorithms for bin packing: a survey","author":"Coffman","year":"1997"},{"key":"10.1016\/j.dam.2003.08.004_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","article-title":"Packing problems","volume":"56","author":"Dowsland","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2003.08.004_BIB5","series-title":"Cutting and packing in production and distribution","author":"Dyckhoff","year":"1992"},{"key":"10.1016\/j.dam.2003.08.004_BIB6","series-title":"Annotated Bibliographies in Combinatorial Optimization","first-page":"393","article-title":"Cutting and packing (C&P)","author":"Dyckhoff","year":"1997"},{"key":"10.1016\/j.dam.2003.08.004_BIB7","unstructured":"O. Faroe, D. Pisinger, M. Zachariasen, Guided local search for the three-dimensional bin packing problem, Technical Report 99\/13, DIKU, University of Copenhagen, Denmark, 1999."},{"key":"10.1016\/j.dam.2003.08.004_BIB8","unstructured":"S.P. Fekete, J. Schepers, New classes of lower bounds for bin-packing problem, IPCO 98, Springer Lecture Notes in Computer Science, Vol. 1412, 1998, pp. 257\u2013270."},{"key":"10.1016\/j.dam.2003.08.004_BIB9","unstructured":"S.P. Fekete, J. Schepers, On more-dimensional packing II: bounds, Technical Report 97.289, Universit\u00e4t zu K\u00f6ln, Germany, 2000."},{"key":"10.1016\/j.dam.2003.08.004_BIB10","series-title":"Computer and intractability, a guide to the theory of np-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.dam.2003.08.004_BIB11","first-page":"3","article-title":"The two-dimensional packing problems","volume":"141","author":"Lodi","year":"2002","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2003.08.004_BIB12","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","article-title":"Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems","volume":"11","author":"Lodi","year":"1999","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.dam.2003.08.004_BIB13","unstructured":"A. Lodi, S. Martello, D. Vigo, Heuristic algorithms for the three-dimensional bin packing problem, DEIS, University of Bologna, Technical Report OR-00-13, 2000."},{"key":"10.1016\/j.dam.2003.08.004_BIB14","first-page":"373","article-title":"Recent advances on two-dimensional bin packing problems","volume":"123\u2013124","author":"Lodi","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2003.08.004_BIB15","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","article-title":"The three-dimensional bin packing problem","volume":"48","author":"Martello","year":"2000","journal-title":"Oper. Res."},{"key":"10.1016\/j.dam.2003.08.004_BIB16","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","article-title":"Exact solution of the two dimensional finite bin packing problem","volume":"44","author":"Martello","year":"1998","journal-title":"Manage. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03005559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03005559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T05:26:09Z","timestamp":1550381169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03005559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0166218X03005559"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2003.08.004","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}