{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T18:33:03Z","timestamp":1774377183996,"version":"3.50.1"},"reference-count":21,"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-0452-9","type":"journal-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T16:17:11Z","timestamp":1225988231000},"page":"221-241","source":"Crossref","is-referenced-by-count":14,"title":["A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint"],"prefix":"10.1007","volume":"179","author":[{"given":"Andrea","family":"Bettinelli","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Ceselli","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Righini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"452_CR1","unstructured":"Achterberg, T. (2004). SCIP\u2014a framework to integrate constraint and mixed integer programming (ZIB\u00a0report 04-19). Berlin."},{"key":"452_CR2","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., & Valerio 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":"452_CR3","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., & Valerio de Carvalho, J. M. (2008). A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers and Operations Research, 35, 1315\u20131328.","journal-title":"Computers and Operations Research"},{"key":"452_CR4","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":"452_CR5","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1057\/palgrave.jors.2602263","volume":"58","author":"G. Br\u00f8nmo","year":"2007","unstructured":"Br\u00f8nmo, G., Christiansen, M., & Nygreen, B. (2007a). Ship scheduling with flexible Cargo sizes. Journal of the Operational Research Society, 58, 1167\u20131177.","journal-title":"Journal of the Operational Research Society"},{"key":"452_CR6","unstructured":"Br\u00f8nmo, G., Nygreen, B., & Lysgaard, J. (2007b). Approximate column generation for some ship scheduling problems. In Proc. TRISTAN VI. Phuket Island, Thailand."},{"key":"452_CR7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.1030.0050","volume":"17","author":"P. Cappanera","year":"2005","unstructured":"Cappanera, P., & Trubian, M. (2005). A local search based heuristic for the demand constrained multidimensional knapsack problem. INFORMS Journal on Computing, 17, 82\u201398.","journal-title":"INFORMS Journal on Computing"},{"key":"452_CR8","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":"452_CR9","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 and Operations Research, 35, 2103\u20132113.","journal-title":"Computers and Operations Research"},{"key":"452_CR10","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":"452_CR11","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.43.1.130","volume":"43","author":"L. Gouveia","year":"1995","unstructured":"Gouveia, L. (1995). A 2n constraint formulation for the capacitated minimal spanning tree problem. Operations Research, 43, 130\u2013141.","journal-title":"Operations Research"},{"key":"452_CR12","unstructured":"Gr\u00f8nhaug, R., Christiansen, M., Desaulniers, G., & Desrosiers, J. (2007). Inventory routing problem for the LNG business. In Proc. TRISTAN VI. Phuket Island, Thailand."},{"key":"452_CR13","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":"452_CR14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/B:JOCO.0000038915.62826.79","volume":"8","author":"A. Lodi","year":"2004","unstructured":"Lodi, A., Martello, S., & Vigo, D. (2004). Models and bounds for two dimensional packing problems. Journal of Combinatorial Optimization, 8, 363\u2013379.","journal-title":"Journal of Combinatorial Optimization"},{"key":"452_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. New York: Wiley (Available online)."},{"key":"452_CR16","unstructured":"Monaci, M. (2002). Algorithms for packing and scheduling problems. PhD thesis OR\/02\/4, DEIS, Universit\u00e0 di Bologna."},{"key":"452_CR17","first-page":"229","volume":"21","author":"F. D. Murgolo","year":"1988","unstructured":"Murgolo, F. D. (1988). An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing, 21, 229\u2013243.","journal-title":"SIAM Journal on Computing"},{"key":"452_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/ijoc.12.1.75.11898","volume":"34","author":"D. Pisinger","year":"2000","unstructured":"Pisinger, D. (2000). A minimal algorithm for the bounded knapsack problem. INFORMS Journal on Computing, 34, 75\u201384.","journal-title":"INFORMS Journal on Computing"},{"key":"452_CR19","volume-title":"Computer scheduling of public transport urban passenger vehicle and crew scheduling","author":"D. M. Ryan","year":"1981","unstructured":"Ryan, D. M., & Foster, B. A. (1981). An integer programming approach to scheduling. In A. Wren (Ed.), Computer scheduling of public transport urban passenger vehicle and crew scheduling. Amsterdam: North-Holland."},{"issue":"2","key":"452_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.1030.0060","volume":"17","author":"J. M. Valerio de Carvalho","year":"2005","unstructured":"Valerio de Carvalho, J. M. (2005). Using extra dual cuts to accelerate column generation. INFORMS Journal on Computing, 17(2), 175\u2013182.","journal-title":"INFORMS Journal on Computing"},{"key":"452_CR21","unstructured":"Walkowiak, R. (2005). Shipment cost optimization. In European chapter on combinatorial optimization XVIII. Minsk."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0452-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0452-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0452-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:51Z","timestamp":1559153271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0452-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,7]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["452"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0452-9","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]]}}}