{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T06:56:32Z","timestamp":1775458592643,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4125,"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":[[2002,4]]},"DOI":"10.1016\/s0166-218x(01)00253-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"13-24","source":"Crossref","is-referenced-by-count":50,"title":["A lower bound for the non-oriented two-dimensional bin packing problem"],"prefix":"10.1016","volume":"118","author":[{"given":"Mauro","family":"Dell'Amico","sequence":"first","affiliation":[]},{"given":"Silvano","family":"Martello","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Vigo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0166-218X(01)00253-0_BIB1","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0604039","article-title":"Approximation algorithms for maximizing the number of squares packed into a rectangle","volume":"4","author":"Baker","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(01)00253-0_BIB2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1093\/comjnl\/25.3.353","article-title":"Packing rectangular pieces \u2014 a heuristic approach","volume":"25","author":"Bengtsson","year":"1982","journal-title":"Comput. J."},{"key":"10.1016\/S0166-218X(01)00253-0_BIB3","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\/S0166-218X(01)00253-0_BIB4","series-title":"Cutting and Packing in Production and Distribution","author":"Dyckhoff","year":"1992"},{"key":"10.1016\/S0166-218X(01)00253-0_BIB5","series-title":"Annotated Bibliographies in Combinatorial Optimization","article-title":"Cutting and Packing (C&P)","author":"Dyckhoff","year":"1997"},{"key":"10.1016\/S0166-218X(01)00253-0_BIB6","first-page":"265","article-title":"A search based heuristic for the two-dimensional bin-packing problem","volume":"32","author":"El-Bouri","year":"1994","journal-title":"INFOR"},{"key":"10.1016\/S0166-218X(01)00253-0_BIB7","unstructured":"S.P. Fekete, J. Schepers, On more-dimensional packing II: Bounds, Technical Report ZPR97-289, Mathematisches Institut, Universit\u00e4t zu K\u00f6ln, 2000."},{"key":"10.1016\/S0166-218X(01)00253-0_BIB8","unstructured":"C.E. Ferreira, F.K. Miyazawa, Y. Wakabayashi, Packing squares into squares, Technical Report, Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas, Brazil, 1999."},{"key":"10.1016\/S0166-218X(01)00253-0_BIB9","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\/S0166-218X(01)00253-0_BIB10","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\/S0166-218X(01)00253-0_BIB11","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":"Management Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002530?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002530?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:57:18Z","timestamp":1556776638000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0166218X01002530"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00253-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}