{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:50:50Z","timestamp":1648536650522},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,14]],"date-time":"2014-09-14T00:00:00Z","timestamp":1410652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s11590-014-0789-8","type":"journal-article","created":{"date-parts":[[2014,9,13]],"date-time":"2014-09-13T09:11:54Z","timestamp":1410599514000},"page":"209-223","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing the optimality gap and the optimal packings for the bin packing problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Samir","family":"Elhedhli","sequence":"first","affiliation":[]},{"given":"Fatma","family":"Gzara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,14]]},"reference":[{"issue":"1","key":"789_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ejor.2004.08.036","volume":"171","author":"G Belov","year":"2006","unstructured":"Belov, G., Scheithauer, G.: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. 171(1), 85\u2013106 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"789_CR2","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.1060.0278","volume":"54","author":"H Ben Amor","year":"2006","unstructured":"Ben Amor, H., Desrosiers, J., De Carvalho, J.M.V.: Dual-optimal inequalities for stabilized column generation. Opns. Res. 54(3), 454\u2013463 (2006)","journal-title":"Opns. Res."},{"key":"789_CR3","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"EG Coffman Jr","year":"1997","unstructured":"Jr Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems. Pws Publishing Company, Pacific Grove (1997)"},{"key":"789_CR4","volume-title":"Handbook of Combinatorial Optimization","author":"EG Coffman Jr","year":"2013","unstructured":"Jr Coffman, E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Du, D.-Z., Pardalos, P.M., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, 2nd edn. Springer, New York (2013)","edition":"2"},{"key":"789_CR5","first-page":"626","volume":"86","author":"JMV Carvalho De","year":"1999","unstructured":"De Carvalho, J.M.V.: Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Opns. Res. 86, 626\u2013659 (1999)","journal-title":"Ann. Opns. Res."},{"issue":"2","key":"789_CR6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"JMV Carvalho De","year":"2002","unstructured":"De Carvalho, J.M.V.: LP models for bin packing and cutting stock problems. Eur. J. Oper. Res. 141(2), 253\u2013273 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"789_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.1030.0060","volume":"17","author":"JMV Carvalho De","year":"2005","unstructured":"De Carvalho, J.M.V.: Using extra dual cuts to accelerate convergence in column generation. INFORMS J. Comput. 17(2), 175\u2013182 (2005)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"789_CR8","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.: Ranking lower bounds for the bin-packing problem. Eur. J. Oper. Res. 160(1), 34\u201346 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"789_CR9","unstructured":"ESICUP: EURO special interest group on cutting and packing. http:\/\/paginas.fe.up.pt\/esicup\/tiki-list_file_gallery.php?galleryId=1.2014"},{"issue":"5","key":"789_CR10","first-page":"30","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin-packing. J. Heuristics 2(5), 30 (1996)","journal-title":"J. Heuristics"},{"key":"789_CR11","first-page":"8214","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: Lagrangian relaxation for integer programming. Math. Program. Study 2, 8214 (1974)","journal-title":"Math. Program. Study"},{"issue":"6","key":"789_CR12","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Opns. Res. 9(6), 849\u2013859 (1961)","journal-title":"Opns. Res."},{"issue":"6","key":"789_CR13","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"PC Gilmore","year":"1963","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem-part II. Opns. Res. 11(6), 863\u2013888 (1963)","journal-title":"Opns. Res."},{"key":"789_CR14","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., Jurgens, C.: Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Opns. Res. 24, 627\u2013645 (1997)","journal-title":"Comput. Opns. Res."},{"key":"789_CR15","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.: The bin-packing problem a problem: generator and some numerical experiments with FFD packing and MTP. Int. Trans. Opns. Res. 4, 377\u2013389 (1997)","journal-title":"Int. Trans. Opns. Res."},{"key":"789_CR16","unstructured":"Schoenfield, J.E.: Fast, Exact Solution of Open Bin Packing Problems without Linear Programming, Draft. US Army Space and Missile Defense Command, Huntsville, AL, USA (2002)"},{"key":"789_CR17","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s101070050105","volume":"86","author":"F Vanderbeck","year":"1999","unstructured":"Vanderbeck, F.: Computational study of a column generation algorithm for bin-packing and cutting stock problems. Math. Program. A. 86, 565\u2013594 (1999)","journal-title":"Math. Program. A."},{"key":"789_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.: Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum 18, 131\u2013144 (1996)","journal-title":"OR Spektrum"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0789-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0789-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0789-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:39Z","timestamp":1559394699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0789-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,14]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["789"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0789-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,14]]}}}