{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:24Z","timestamp":1759847844878},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T00:00:00Z","timestamp":1350000000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10898-012-9989-x","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T10:16:35Z","timestamp":1349950595000},"page":"1025-1038","source":"Crossref","is-referenced-by-count":14,"title":["Efficient algorithms for the offline variable sized bin-packing problem"],"prefix":"10.1007","volume":"57","author":[{"given":"Mohamed","family":"Maiza","sequence":"first","affiliation":[]},{"given":"Abdenour","family":"Labed","sequence":"additional","affiliation":[]},{"given":"Mohammed Said","family":"Radjef","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,12]]},"reference":[{"key":"9989_CR1","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1111\/j.1475-3995.2005.00523.x","volume":"12","author":"C. Basnet","year":"2005","unstructured":"Basnet C., Wilson J.: Heuristics for determining the number of warehouses for storing non-compatible products. Int. Trans. Oper. Res. 12, 527\u2013538 (2005)","journal-title":"Int. Trans. Oper. Res."},{"key":"9989_CR2","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/S0377-2217(02)00125-X","volume":"141","author":"G. Belov","year":"2002","unstructured":"Belov G., Scheithauer G.: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. 141, 274\u2013294 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9989_CR3","first-page":"2069","volume":"30","author":"C. Blum","year":"2001","unstructured":"Blum C., Hemmelmayr V., Hernndez H., Schmid V.: Hybrid algorithms for the variable sized bin packing problem. Lect. Notes Comput. Sci. 30, 2069\u20132083 (2001). doi: 10.1007\/978-3-642-16054-7_2","journal-title":"Lect. Notes Comput. Sci."},{"key":"9989_CR4","doi-asserted-by":"crossref","first-page":"2069","DOI":"10.1137\/S009753979834669X","volume":"30","author":"C. Chu","year":"2001","unstructured":"Chu C., La R.: Variable-sized bin packing: tight absolute worst-case performance ratios for four approximation algorithms. SIAM J. Comput. 30, 2069\u20132083 (2001)","journal-title":"SIAM J. Comput."},{"key":"9989_CR5","first-page":"46","volume-title":"Approximation Algorithms for NP-hard Problems: Approximation Algorithms for Bin-packing\u2014A Survey","author":"J.E.G. Coffmann","year":"1997","unstructured":"Coffmann J.E.G., Garey M.R., Johnson D.S.: Approximation Algorithms for NP-hard Problems: Approximation Algorithms for Bin-packing\u2014A Survey, pp. 46\u201393. PWS Publishing, Boston (1997)"},{"key":"9989_CR6","doi-asserted-by":"crossref","first-page":"2103","DOI":"10.1016\/j.cor.2006.10.014","volume":"35","author":"I. Correia","year":"2008","unstructured":"Correia I., Gouveia L., Saldanha-Da-Gama F.: Solving the variable size bin-packing problem with discretized formulations. Comput. Oper. Res. 35, 2103\u20132113 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"9989_CR7","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1016\/j.cor.2011.01.001","volume":"38","author":"T.G. Crainic","year":"2011","unstructured":"Crainic T.G., Perboli G., Rei W., Tadei R.: Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Comput. Oper. Res. 38(11), 1474\u20131482 (2011)","journal-title":"Comput. Oper. Res."},{"key":"9989_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.17.5.259","volume":"17","author":"S. Eilon","year":"1971","unstructured":"Eilon S., Christofides N.: The loading problem. Manag. Sci. 17, 259\u2013268 (1971)","journal-title":"Manag. Sci."},{"key":"9989_CR9","doi-asserted-by":"crossref","unstructured":"Epstein, L., Favrholdt, L.M.: On-line maximizing the number of items packed in variable-sized bins. In: Ibarra, O.H., Zhang, L. (eds.) Lecture Notes in Computer Science vol. 2387, pp. 467\u2013475. COCOON 2002, Springer, Berlin (2002)","DOI":"10.1007\/3-540-45655-4_50"},{"key":"9989_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E. Falkenauer","year":"1996","unstructured":"Falkenauer E.: A hybrid grouping genetic algorithm. J. Heuristics 2, 5\u201330 (1996)","journal-title":"J. Heuristics"},{"key":"9989_CR11","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K. Fleszar","year":"2002","unstructured":"Fleszar K., Hindi K.S.: New heuristics for one-dimensional bin-packing. Comput. Oper. Res. 29, 821\u2013839 (2002)","journal-title":"Comput. Oper. Res."},{"key":"9989_CR12","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D.K. Friesen","year":"1986","unstructured":"Friesen D.K., Langston M.A.: Variable sized bin-packing. SIAM J. Comput. 15, 222\u2013230 (1986)","journal-title":"SIAM J. Comput."},{"key":"9989_CR13","volume-title":"Computers and Intratability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intratability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"issue":"6","key":"9989_CR14","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1080\/095372899232894","volume":"10","author":"J.N.D. Gupta","year":"1999","unstructured":"Gupta J.N.D., Ho J.C.: A new heuristic algorithm for the one-dimensional bin-packing problem. Prod. Plan. Control 10(6), 598\u2013603 (1999)","journal-title":"Prod. Plan. Control"},{"issue":"10","key":"9989_CR15","doi-asserted-by":"crossref","first-page":"2877","DOI":"10.1016\/j.cor.2008.12.016","volume":"36","author":"M. Haouari","year":"2009","unstructured":"Haouari M., Serairi M.: Heuristics for the variable sized bin-packing problem. Comput. Oper. Res. 36(10), 2877\u20132884 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9989_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10589-009-9276-z","volume":"48","author":"M. Haouari","year":"2011","unstructured":"Haouari M., Serairi M.: Relaxations and exact solution of the variable sized bin packing problem. Comput. Optim. Appl. 48, 345\u2013368 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"9989_CR17","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/ijoc.1070.0233","volume":"20","author":"M. Hifi","year":"2008","unstructured":"Hifi M., MHallah R., Saadi T.: Algorithms for constrained two-staged two-dimensional cutting problems. INFORMS J. Comput. 20, 212\u2013221 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"9989_CR18","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson D.S., Demers A., Ullman J.D., Garey M.R., Graham R.L.: Worst-case performance bound for simple one dimensional packing algorithms. SIAM J. comput. 3(4), 299\u2013325 (1974)","journal-title":"SIAM J. comput."},{"key":"9989_CR19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0377-2217(02)00247-3","volume":"147","author":"J. Kang","year":"2003","unstructured":"Kang J., Park S.: Algorithms for the variable sized bin-packing problem. Eur. J. Oper. Res. 147, 365\u2013372 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9989_CR20","unstructured":"Monaci, M.: Algorithms for packing and scheduling problems. Phd thesis or\/02\/4, Universit di Bologna (2002)"},{"issue":"1","key":"9989_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"F.D. Murgolo","year":"1987","unstructured":"Murgolo F.D.: An efficient approximation scheme for variable-sized bin-packing. SIAM J. Comput. 16(1), 149\u2013161 (1987)","journal-title":"SIAM J. Comput."},{"key":"9989_CR22","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"P.S. Ow","year":"1988","unstructured":"Ow P.S., Morton T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26, 35\u201362 (1988)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"9989_CR23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10479-008-0452-9","volume":"179","author":"G. Righini","year":"2010","unstructured":"Righini G., Bettinelli A., Ceselli A.: A branch-and-price algorithm for the variable size bin-packing problem with minimum filling constraint. Ann. Oper. Res. 179(1), 221\u2013241 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"7","key":"9989_CR24","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., Bison J.C.: A fast hybrid procedure for exactly solving the one-dimensional bin-packing problem. Comput. Oper. Res. 24(7), 627\u2013645 (1997)","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9989-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9989-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9989-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T12:06:20Z","timestamp":1562241980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9989-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,12]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9989"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9989-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,12]]}}}