{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:21Z","timestamp":1759847541842},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,29]],"date-time":"2012-12-29T00:00:00Z","timestamp":1356739200000},"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":[[2014,11]]},"DOI":"10.1007\/s10479-012-1283-2","type":"journal-article","created":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T09:32:02Z","timestamp":1356687122000},"page":"125-141","source":"Crossref","is-referenced-by-count":29,"title":["Branch-and-price and beam search algorithms for the Variable Cost and Size Bin Packing Problem with optional items"],"prefix":"10.1007","volume":"222","author":[{"given":"Mauro Maria","family":"Baldi","sequence":"first","affiliation":[]},{"given":"Teodor Gabriel","family":"Crainic","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Perboli","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tadei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,29]]},"reference":[{"key":"1283_CR1","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1016\/j.ejor.2005.07.033","volume":"183","author":"C. Alves","year":"2007","unstructured":"Alves, C., & Val\u00e9rio de Carvalho, J. M. (2007). Accelerating column generation for variable sized bin-packing problems. European Journal of Operational Research, 183, 1333\u20131352.","journal-title":"European Journal of Operational Research"},{"key":"1283_CR2","doi-asserted-by":"crossref","first-page":"1315","DOI":"10.1016\/j.cor.2006.08.014","volume":"35","author":"C. Alves","year":"2008","unstructured":"Alves, C., & Val\u00e9rio de Carvalho, J. M. (2008). A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers & Operations Research, 35, 1315\u20131328.","journal-title":"Computers & Operations Research"},{"key":"1283_CR3","unstructured":"Baldi, M. M., Crainic, T. G., Perboli, G., & Tadei, R. (2011). The generalized bin packing problem. Tech. rep., CIRRELT, CIRRELT-2011-39."},{"issue":"6","key":"1283_CR4","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1016\/j.tre.2012.06.005","volume":"48","author":"M. M. Baldi","year":"2012","unstructured":"Baldi, M. M., Crainic, T. G., Perboli, G., & Tadei, R. (2012). The generalized bin packing problem. Transportation Research. Part E, 48(6), 1205\u20131220.","journal-title":"Transportation Research. Part E"},{"key":"1283_CR5","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. (2002). A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research, 141, 274\u2013294.","journal-title":"European Journal of Operational Research"},{"key":"1283_CR6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10479-008-0452-9","volume":"179","author":"A. Bettinelli","year":"2010","unstructured":"Bettinelli, A., Ceselli, A., & Righini, G. (2010). A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. Annals of Operations Research, 179, 221\u2013241.","journal-title":"Annals of Operations Research"},{"key":"1283_CR7","doi-asserted-by":"crossref","first-page":"2069","DOI":"10.1137\/S009753979834669X","volume":"30","author":"C. Chu","year":"2001","unstructured":"Chu, C., & La, R. (2001). Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing, 30, 2069\u20132083.","journal-title":"SIAM Journal on Computing"},{"key":"1283_CR8","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. (2008). Solving the variable size bin packing problem with discretized formulations. Computers & Operations Research, 35, 2103\u20132113.","journal-title":"Computers & Operations Research"},{"key":"1283_CR9","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. (2011). Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Computers & Operations Research, 38, 1474\u20131482.","journal-title":"Computers & Operations Research"},{"key":"1283_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:HEUR.0000019987.10818.e0","volume":"10","author":"F. Della Croce","year":"2004","unstructured":"Della Croce, F., Ghirardi, M., & Tadei, R. (2004). Recovering beam search: enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics, 10, 89\u2013104.","journal-title":"Journal of Heuristics"},{"key":"1283_CR11","series-title":"GERAD 25th anniversary series","isbn-type":"print","volume-title":"Column generation","year":"2005","unstructured":"Desaulniers, G., Desrosiers, J., & Solomon, M. M. (Eds.) (2005). Column generation. GERAD 25th anniversary series. Berlin: Springer. ISBN 978-0-387-25485-2.","ISBN":"http:\/\/id.crossref.org\/isbn\/9780387254852"},{"key":"1283_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. (1986). Variable sized bin packing. SIAM Journal on Computing, 15, 222\u2013230.","journal-title":"SIAM Journal on Computing"},{"key":"1283_CR13","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. (2009). Heuristics for the variable sized bin-packing problem. Computers & Operations Research, 36, 2877\u20132884.","journal-title":"Computers & Operations Research"},{"key":"1283_CR14","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. (2011). Relaxations and exact solution of the variable sized bin packing problem. Computational Optimization and Applications, 48, 345\u2013368.","journal-title":"Computational Optimization and Applications"},{"key":"1283_CR15","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/j.cor.2011.07.003","volume":"39","author":"V. Hemmelmayr","year":"2012","unstructured":"Hemmelmayr, V., Schmid, V., & Blum, C. (2012). Variable neighbourhood search for the variable sized bin packing problem. Computers & Operations Research, 39, 1097\u20131108.","journal-title":"Computers & Operations Research"},{"key":"1283_CR16","doi-asserted-by":"crossref","first-page":"2657","DOI":"10.1016\/j.cor.2005.10.004","volume":"34","author":"H. Hifi","year":"2007","unstructured":"Hifi, H., & Michrafy, M. (2007). Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. Computers & Operations Research, 34, 2657\u20132673.","journal-title":"Computers & Operations Research"},{"key":"1283_CR17","unstructured":"ILOG Inc (2009). IBM ILOG CPLEX v12.1 User\u2019s Manual."},{"key":"1283_CR18","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. (2003). Algorithms for the variable sized bin packing problem. European Journal of Operational Research, 147, 365\u2013372.","journal-title":"European Journal of Operational Research"},{"key":"1283_CR19","volume-title":"Knapsack problems\u2014algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems\u2014algorithms and computer implementations. Chichester, UK: Wiley."},{"key":"1283_CR20","unstructured":"Monaci, M. (2002). Algorithms for packing and scheduling problems. PhD thesis, Universit\u00e0 di Bologna, Bologna, Italy."},{"key":"1283_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"F. D. Murgolo","year":"1987","unstructured":"Murgolo, F. D. (1987). An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing, 16, 149\u2013161.","journal-title":"SIAM Journal on Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1283-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1283-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1283-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:39Z","timestamp":1559138979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1283-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,29]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1283"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1283-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,29]]}}}