{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:20:04Z","timestamp":1759666804385},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10479-008-0459-2","type":"journal-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T10:55:17Z","timestamp":1225968917000},"page":"187-202","source":"Crossref","is-referenced-by-count":4,"title":["A new destructive bounding scheme for\u00a0the bin packing problem"],"prefix":"10.1007","volume":"179","author":[{"given":"Bassem","family":"Jarboui","sequence":"first","affiliation":[]},{"given":"Saber","family":"Ibrahim","sequence":"additional","affiliation":[]},{"given":"Abdelwaheb","family":"Rebai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"459_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"A. Alvim","year":"2004","unstructured":"Alvim, A., Ribeiro, C., Glover, F., & Aloise, D. (2004). A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics, 10, 205\u2013229.","journal-title":"Journal of Heuristics"},{"key":"459_CR2","first-page":"135","volume":"1","author":"M. Boschetti","year":"2003","unstructured":"Boschetti, M., & Mingozzi, A. (2003). The two-dimensional finite bin packing problem. Part II: new lower and upper bounds. 4OR: A Quarterly Journal of Operations Research, 1, 135\u2013147.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"3","key":"459_CR3","first-page":"395","volume":"32","author":"J. M. Bourjolly","year":"2005","unstructured":"Bourjolly, J. M., & Rebetez, V. (2005). An analysis of lower bound procedures for the bin packing problem. Computers and. Operations Research, 32(3), 395\u2013405.","journal-title":"Operations Research"},{"key":"459_CR4","doi-asserted-by":"crossref","first-page":"2223","DOI":"10.1016\/j.cor.2005.08.012","volume":"34","author":"J. Carlier","year":"2007","unstructured":"Carlier, J., Clautiaux, F., & Moukrim, F. (2007). New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Computers and Operations Research, 34, 2223\u20132250.","journal-title":"Computers and Operations Research"},{"key":"459_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0166-218X(96)80459-8","volume":"66","author":"B. Chen","year":"1996","unstructured":"Chen, B., & Srivastava, B. (1996). An improved lower bound for the bin packing problem. Discrete Applied Mathematics, 66, 81\u201394.","journal-title":"Discrete Applied Mathematics"},{"key":"459_CR6","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E. G. Coffman Jr","year":"1997","unstructured":"Coffman Jr, E. G., Gary, M. R., & Johnson, D. S. (1997). Approximation algorithms for bin packing: a survey. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46\u201393). Boston: PWS Publishing."},{"key":"459_CR7","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1016\/j.ejor.2005.07.032","volume":"183","author":"T. G. Crainic","year":"2007","unstructured":"Crainic, T. G., Perboli, G., Pezzuto, M., & Tadei, R. (2007a). Computing the asymptotic worst-case of bin packing lower bounds. European Journal of Operational Research, 183, 1295\u20131303.","journal-title":"European Journal of Operational Research"},{"key":"459_CR8","doi-asserted-by":"crossref","first-page":"3439","DOI":"10.1016\/j.cor.2006.02.007","volume":"34","author":"T. G. Crainic","year":"2007","unstructured":"Crainic, T. G., Perboli, G., Pezzuto, M., & Tadei, R. (2007b). New bin packing fast lower bounds. Computers and Operations Research, 34, 3439\u20133457.","journal-title":"Computers and Operations Research"},{"key":"459_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M. Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico, M., & Martello, S. (1995). Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing, 7, 191\u2013200.","journal-title":"ORSA Journal on Computing"},{"key":"459_CR10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ejor.2003.06.019","volume":"160","author":"S. Elhedhli","year":"2005","unstructured":"Elhedhli, S. (2005). Ranking lower bounds for the bin packing problem. European Journal of Operational Research, 160, 34\u201346.","journal-title":"European Journal of Operational Research"},{"key":"459_CR11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"S. Fekete","year":"2001","unstructured":"Fekete, S., & Schepers, J. (2001). New classes of fast lower bounds for bin packing problems. Mathematical Programming, 91, 11\u201331.","journal-title":"Mathematical Programming"},{"key":"459_CR12","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: W. H. Freeman."},{"key":"459_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.disopt.2005.06.002","volume":"2","author":"M. Haouari","year":"2005","unstructured":"Haouari, M., & Gharbi, A. (2005). Fast lifting procedures for the bin packing problem. Discrete Optimization, 2, 201\u2013218.","journal-title":"Discrete Optimization"},{"key":"459_CR14","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/opre.39.4.616","volume":"39","author":"M. Labb\u00e9","year":"1991","unstructured":"Labb\u00e9, M., Laporte, G., & Mercure, H. (1991). Capacitated vehicle routing on trees. Operations Research, 39, 616\u2013622.","journal-title":"Operations Research"},{"key":"459_CR15","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: algorithms and computer implementations. Chichester: Wiley."},{"key":"459_CR16","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A. Scholl","year":"1997","unstructured":"Scholl, A., Klein, R., & J\u00fcrgens, C. (1997). BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers and Operations Research, 24, 627\u2013645.","journal-title":"Computers and Operations Research"},{"issue":"5\/6","key":"459_CR17","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1111\/j.1475-3995.1997.tb00093.x","volume":"4","author":"P. Schwerin","year":"1997","unstructured":"Schwerin, P., & W\u00e4scher, G. (1997). The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP. International Transactions in Operational Research, 4(5\/6), 377\u2013389.","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"459_CR18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01539705","volume":"18","author":"G. W\u00e4scher","year":"1996","unstructured":"W\u00e4scher, G., & Gau, T. (1996). Heuristics for the Integer one-dimensional cutting stock problem\u2014a computational study. OR Spektrum, 18(3), 131\u2013144.","journal-title":"OR Spektrum"},{"issue":"3","key":"459_CR19","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109\u20131130.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0459-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0459-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0459-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:51Z","timestamp":1559138871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0459-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["459"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0459-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,7]]}}}