{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:20:35Z","timestamp":1760440835682},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,7,22]],"date-time":"2009-07-22T00:00:00Z","timestamp":1248220800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10589-009-9276-z","type":"journal-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T10:23:32Z","timestamp":1248171812000},"page":"345-368","source":"Crossref","is-referenced-by-count":28,"title":["Relaxations and exact solution of the variable sized bin\u00a0packing problem"],"prefix":"10.1007","volume":"48","author":[{"given":"Mohamed","family":"Haouari","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Serairi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,22]]},"reference":[{"key":"9276_CR1","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","volume":"50","author":"R.K. Ahuja","year":"2004","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutell\u00e0, M.G.: A multi-exchange heuristic for the single source capacitated facility location problem. Manag. Sci. 50, 749\u2013760 (2004)","journal-title":"Manag. Sci."},{"key":"9276_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.: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput. Oper. Res. 35, 1315\u20131328 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9276_CR3","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.: Accelerating column generation for variable sized bin-packing problems. Eur. J. Oper. Res. 183, 1333\u20131352 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9276_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.: 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":"9276_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0167-6377(03)00092-0","volume":"32","author":"A. Caprara","year":"2004","unstructured":"Caprara, A., Pferschy, U.: Worst-case analysis of the subset sum algorithm for bin packing. Oper. Res. Lett. 32, 159\u2013166 (2004)","journal-title":"Oper. Res. Lett."},{"key":"9276_CR6","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.: An improved lower bound for the bin packing problem. Discrete Appl. Math. 66, 81\u201394 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9276_CR7","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":"9276_CR8","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/0885-064X(87)90009-4","volume":"3","author":"E.G. Coffman","year":"1987","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Bin packing with divisible item sizes. J. Complex. 3, 406\u2013428 (1987)","journal-title":"J. Complex."},{"key":"9276_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.: Solving the variable size bin packing problem with discretized formulations. Comput. Oper. Res. 35, 2103\u20132113 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9276_CR10","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S1571-0653(04)00248-3","volume":"7","author":"M. Dawande","year":"2001","unstructured":"Dawande, M., Kalagnanam, J., Jay, S.: Variable sized bin Packing with color constraints. Electron. Notes Discret. Math. 7, 154\u2013157 (2001)","journal-title":"Electron. Notes Discret. Math."},{"key":"9276_CR11","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":"9276_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1111\/j.1475-3995.2007.00605.x","volume":"15","author":"M. Haouari","year":"2008","unstructured":"Haouari, M., Jammali, M.: Tight bounds for the identical parallel machine scheduling problem: Part\u00a0II. Int. Trans. Oper. Res. 15, 19\u201334 (2008)","journal-title":"Int. Trans. Oper. Res."},{"key":"9276_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, J.: Algorithms for the variable sized bin packing problem. Eur. J. Oper. Res. 147, 365\u2013372 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9276_CR14","doi-asserted-by":"crossref","unstructured":"Monaci, M.: Algorithms for packing and scheduling problems. Ph.D. Thesis, University, of Bologna (2002)","DOI":"10.1007\/s10288-002-0011-1"},{"key":"9276_CR15","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, 149\u2013161 (1987)","journal-title":"SIAM J. Comput."},{"key":"9276_CR16","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.disopt.2005.01.002","volume":"2","author":"D. Pisinger","year":"2005","unstructured":"Pisinger, D., Sigurd, M.: The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optim. 2, 154\u2013167 (2005)","journal-title":"Discrete Optim."},{"key":"9276_CR17","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/S0377-2217(01)00237-5","volume":"140","author":"J. Renaud","year":"2002","unstructured":"Renaud, J., Boctor, F.: A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 140, 618\u2013628 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9276_CR18","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02309343","volume":"56","author":"G. Zhang","year":"1996","unstructured":"Zhang, G.: Worst-case analysis of the FFH algorithm for online variable-sized bin packing. Comput. 56, 165\u2013172 (1996)","journal-title":"Comput."},{"key":"9276_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"9276_CR20","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9276-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9276-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9276-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:37Z","timestamp":1559288197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9276-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,22]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9276"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9276-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,22]]}}}