{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:35:58Z","timestamp":1759847758633,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T00:00:00Z","timestamp":1525651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"DIMECC Need for Speed"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10732-018-9375-z","type":"journal-article","created":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T08:21:20Z","timestamp":1525681280000},"page":"697-723","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Fast algorithms for fragmentable items bin packing"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9512-2400","authenticated-orcid":false,"given":"Benjamin","family":"Byholm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Porres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,7]]},"reference":[{"key":"9375_CR1","doi-asserted-by":"publisher","unstructured":"Byholm, B.: fragbinpacking-optimizer v1.3 (2017a). \n                    https:\/\/doi.org\/10.5281\/zenodo.1068975","DOI":"10.5281\/zenodo.1068975"},{"key":"9375_CR2","doi-asserted-by":"publisher","unstructured":"Byholm, B.: fragbinpacking-problems v1.1 (2017b). \n                    https:\/\/doi.org\/10.5281\/zenodo.253942","DOI":"10.5281\/zenodo.253942"},{"key":"9375_CR3","doi-asserted-by":"publisher","unstructured":"Byholm, B.: fragbinpacking-results v1.3 (2017c). \n                    https:\/\/doi.org\/10.5281\/zenodo.1068972","DOI":"10.5281\/zenodo.1068972"},{"issue":"C","key":"9375_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2013.12.008","volume":"46","author":"M Casazza","year":"2014","unstructured":"Casazza, M., Ceselli, A.: Mathematical programming algorithms for bin packing problems with item fragmentation. Comput. Oper. Res. 46(C), 1\u201311 (2014). \n                    https:\/\/doi.org\/10.1016\/j.cor.2013.12.008","journal-title":"Comput. Oper. Res."},{"issue":"C","key":"9375_CR5","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.cor.2016.06.007","volume":"75","author":"M Casazza","year":"2016","unstructured":"Casazza, M., Ceselli, A.: Exactly solving packing problems with fragmentation. Comput. Oper. Res. 75(C), 202\u2013213 (2016). \n                    https:\/\/doi.org\/10.1016\/j.cor.2016.06.007","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9375_CR6","first-page":"2","volume":"33","author":"E Falkenauer","year":"1992","unstructured":"Falkenauer, E.: The grouping genetic algorithms\u2014widening the scope of the GAs. Belg. J. Oper. Res. Stat. Comput. Sci. 33(1), 2 (1992)","journal-title":"Belg. J. Oper. Res. Stat. Comput. Sci."},{"issue":"1","key":"9375_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2(1), 5\u201330 (1996). \n                    https:\/\/doi.org\/10.1007\/BF00226291","journal-title":"J. Heuristics"},{"issue":"1","key":"9375_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"SP Fekete","year":"2001","unstructured":"Fekete, S.P., Schepers, J.: New classes of fast lower bounds for bin packing problems. Math. Program. 91(1), 11\u201331 (2001). \n                    https:\/\/doi.org\/10.1007\/s101070100243","journal-title":"Math. Program."},{"issue":"4","key":"9375_CR9","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.comgeo.2011.11.006","volume":"45","author":"A Gajentaan","year":"2012","unstructured":"Gajentaan, A., Overmars, M.H.: On a class of \n                    \n                      \n                    \n                    $${O}(n^2)$$\n                    \n                      \n                        \n                          O\n                          (\n                          \n                            n\n                            2\n                          \n                          )\n                        \n                      \n                    \n                   problems in computational geometry. Comput. Geom. 45(4), 140\u2013152 (2012). \n                    https:\/\/doi.org\/10.1016\/j.comgeo.2011.11.006","journal-title":"Comput. Geom."},{"key":"9375_CR10","volume-title":"Computers and Intractability","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman & Co., New York (1990)"},{"issue":"1","key":"9375_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.stamet.2008.04.001","volume":"6","author":"MC Jones","year":"2009","unstructured":"Jones, M.C.: Kumaraswamy\u2019s distribution: a beta-type distribution with some tractability advantages. Stat. Methodol. 6(1), 70\u201381 (2009). \n                    https:\/\/doi.org\/10.1016\/j.stamet.2008.04.001","journal-title":"Stat. Methodol."},{"key":"9375_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2015.08.005","volume":"602","author":"B LeCun","year":"2015","unstructured":"LeCun, B., Mautor, T., Quessette, F., Weisser, M.A.: Bin packing with fragmentable items: presentation and approximations. Theor. Comput. Sci. 602, 50\u201359 (2015). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2015.08.005","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"9375_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0898-1221(98)00087-X","volume":"35","author":"CA Mandal","year":"1998","unstructured":"Mandal, C.A., Chakrabarti, P.P., Ghose, S.: Complexity of fragmentable object bin packing and an application. Comput. Math. Appl. 35(11), 91\u201397 (1998). \n                    https:\/\/doi.org\/10.1016\/S0898-1221(98)00087-X","journal-title":"Comput. Math. Appl."},{"key":"9375_CR14","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2014.10.010","volume":"55","author":"M Quiroz Castellanos","year":"2015","unstructured":"Quiroz Castellanos, M., Cruz Reyes, L., Torres Jim\u00e9nez, J., G\u00f3mez Santill\u00e1n, C., Fraire Huacuja, H.J., Alvim, A.C.: A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. Oper. Res. 55, 52\u201364 (2015). \n                    https:\/\/doi.org\/10.1016\/j.cor.2014.10.010","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-018-9375-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9375-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9375-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T13:13:10Z","timestamp":1557407590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-018-9375-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,7]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9375"],"URL":"https:\/\/doi.org\/10.1007\/s10732-018-9375-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2018,5,7]]},"assertion":[{"value":"17 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}