{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T04:51:43Z","timestamp":1749185503276,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2022\/05803-3","2020\/06511-0"],"award-info":[{"award-number":["2022\/05803-3","2020\/06511-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["311039\/2020-0","144257\/2019-0"],"award-info":[{"award-number":["311039\/2020-0","144257\/2019-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10479-024-06323-8","type":"journal-article","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T19:03:08Z","timestamp":1729191788000},"page":"125-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast neighborhood search heuristics for the colored bin packing problem"],"prefix":"10.1007","volume":"343","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1142-3343","authenticated-orcid":false,"given":"Renan F. F.","family":"da Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1865-4104","authenticated-orcid":false,"given":"Yulle G. F.","family":"Borges","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0472-4810","authenticated-orcid":false,"given":"Rafael C. S.","family":"Schouery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"unstructured":"Alsarhan, H., Chia, D., Christman, A., Fu, S., & Jin, Y. (2016). A Two-Pass Algorithm for Unordered Colored Bin Packing. In Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (pp. 1\u201310).","key":"6323_CR1"},{"issue":"1","key":"6323_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/ijoc.2022.0257","volume":"36","author":"R Baldacci","year":"2024","unstructured":"Baldacci, R., Coniglio, S., Cordeau, J. F., et al. (2024). A numerically exact algorithm for the bin-packing problem. INFORMS Journal on Computing, 36(1), 141\u2013162. https:\/\/doi.org\/10.1287\/ijoc.2022.0257","journal-title":"INFORMS Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Balogh, J. B\u00e9k\u00e9si J, D\u00f3sa, G., et\u00a0al. (2013) Black and white bin packing. In: Erlebach T, Persiano G (eds) Approximation and Online Algorithms. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 131\u2013144, 10.1007\/978-3-642-38016-7_12","key":"6323_CR3","DOI":"10.1007\/978-3-642-38016-7_12"},{"issue":"1","key":"6323_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00224-014-9538-8","volume":"56","author":"J Balogh","year":"2015","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., et al. (2015). Online results for black and white bin packing. Theory of Computing Systems, 56(1), 137\u2013155. https:\/\/doi.org\/10.1007\/s00224-014-9538-8","journal-title":"Theory of Computing Systems"},{"key":"6323_CR5","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2015.06.045","volume":"596","author":"J Balogh","year":"2015","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., et al. (2015). Offline black and white bin packing. Theoretical Computer Science, 596, 92\u2013101. https:\/\/doi.org\/10.1016\/j.tcs.2015.06.045","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6323_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ejor.2004.08.036","volume":"171","author":"G Belov","year":"2006","unstructured":"Belov, G., & Scheithauer, G. (2006). A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. European Journal of Operational Research, 171(1), 85\u2013106. https:\/\/doi.org\/10.1016\/j.ejor.2004.08.036","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"6323_CR7","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10100-012-0269-0","volume":"21","author":"A Benk\u0151","year":"2013","unstructured":"Benk\u0151, A., D\u00f3sa, G., & Tuza, Z. (2013). Bin covering with a general profit function: approximability results. Central European Journal of Operations Research, 21(4), 805\u2013816. https:\/\/doi.org\/10.1007\/s10100-012-0269-0","journal-title":"Central European Journal of Operations Research"},{"doi-asserted-by":"crossref","unstructured":"B\u00f6hm, M., Sgall, J., Vesel\u00fd, P. (2015) Online colored bin packing. In: Bampis, E., Svensson, O. (eds) Approximation and Online Algorithms. Springer International Publishing, Cham, pp. 35\u201346, 10.1007\/978-3-319-18263-6_4","key":"6323_CR8","DOI":"10.1007\/978-3-319-18263-6_4"},{"issue":"1","key":"6323_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00453-016-0248-2","volume":"80","author":"M B\u00f6hm","year":"2018","unstructured":"B\u00f6hm, M., D\u00f3sa, G., Epstein, L., et al. (2018). Colored bin packing: Online algorithms and lower bounds. Algorithmica, 80(1), 155\u2013184. https:\/\/doi.org\/10.1007\/s00453-016-0248-2","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Borges YG, Schouery RC, Miyazawa FK (2024) Mathematical models and exact algorithms for the colored bin packing problem. Computers & Operations Research. p. 106527. 10.1016\/j.cor.2023.106527","key":"6323_CR10","DOI":"10.1016\/j.cor.2023.106527"},{"key":"6323_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.11.009","volume":"69","author":"F Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, F., & Pedroso, J. P. (2016). Bin packing and related problems: General arc-flow formulation with graph compression. Computers & Operations Research, 69, 56\u201367. https:\/\/doi.org\/10.1016\/j.cor.2015.11.009","journal-title":"Computers & Operations Research"},{"key":"6323_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2016.06.009","volume":"76","author":"M Buljuba\u0161i\u0107","year":"2016","unstructured":"Buljuba\u0161i\u0107, M., & Vasquez, M. (2016). Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Computers & Operations Research, 76, 12\u201321. https:\/\/doi.org\/10.1016\/j.cor.2016.06.009","journal-title":"Computers & Operations Research"},{"key":"6323_CR13","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"JMVd Carvalho","year":"1999","unstructured":"Carvalho, J. MVd. (1999). Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research, 86, 629\u2013659. https:\/\/doi.org\/10.1023\/A:1018952112615","journal-title":"Annals of Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Castelli M, Vanneschi L (2014) A hybrid harmony search algorithm with variable neighbourhood search for the bin-packing problem. In 2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014), pp. 1\u20136. 10.1109\/NaBIC.2014.6921849","key":"6323_CR14","DOI":"10.1109\/NaBIC.2014.6921849"},{"doi-asserted-by":"crossref","unstructured":"Chen, J., Han, X., Bein, W., et\u00a0al. (2015) Black and white bin packing revisited. In: Lu Z, Kim D, Wu W, et\u00a0al. (eds) Combinatorial Optimization and Applications. Springer International Publishing, Cham, pp. 45\u201359, 10.1007\/978-3-319-26626-8_4","key":"6323_CR15","DOI":"10.1007\/978-3-319-26626-8_4"},{"issue":"1","key":"6323_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/ijoc.2018.0880","volume":"32","author":"M Delorme","year":"2020","unstructured":"Delorme, M., & Iori, M. (2020). Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. INFORMS Journal on Computing, 32(1), 101\u2013119. https:\/\/doi.org\/10.1287\/ijoc.2018.0880","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"6323_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11590-017-1192-z","volume":"12","author":"M Delorme","year":"2018","unstructured":"Delorme, M., Iori, M., & Martello, S. (2018). Bpplib: A library for bin packing and cutting stock problems. Optimization Letters, 12(2), 235\u2013250. https:\/\/doi.org\/10.1007\/s11590-017-1192-z","journal-title":"Optimization Letters"},{"key":"6323_CR18","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J. (2006). Statistical comparisons of classifiers over multiple data sets. The Journal of Machine learning research, 7, 1\u201330.","journal-title":"The Journal of Machine learning research"},{"doi-asserted-by":"crossref","unstructured":"D\u00f3sa G, Epstein L (2014) Colorful bin packing. In: Ravi R, G\u00f8rtz IL (eds) In: Algorithm Theory\u2013SWAT 2014. Springer International Publishing, Cham, pp 170\u2013181, 10.1007\/978-3-319-08404-6_15","key":"6323_CR19","DOI":"10.1007\/978-3-319-08404-6_15"},{"issue":"2","key":"6323_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T. A., & Resende, M. G. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8(2), 67\u201371. https:\/\/doi.org\/10.1016\/0167-6377(89)90002-3","journal-title":"Operations Research Letters"},{"issue":"7","key":"6323_CR21","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K Fleszar","year":"2002","unstructured":"Fleszar, K., & Hindi, K. S. (2002). New heuristics for one-dimensional bin-packing. Computers & Operations Research, 29(7), 821\u2013839. https:\/\/doi.org\/10.1016\/S0305-0548(00)00082-4","journal-title":"Computers & Operations Research"},{"issue":"200","key":"6323_CR22","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman, M. (1937). The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association, 32(200), 675\u2013701. https:\/\/doi.org\/10.1080\/01621459.1937.10503522","journal-title":"Journal of the American Statistical Association"},{"issue":"6","key":"6323_CR23","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.29.6.1092","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting-stock problem. Operations Research, 9(6), 849\u2013859. https:\/\/doi.org\/10.1287\/opre.29.6.1092","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez-San-Mart\u00edn J, Cruz-Reyes L, G\u00f3mez-Santill\u00e1n C, et\u00a0al. (2023) Comparative Study of Heuristics for the One-Dimensional Bin Packing Problem, Springer Nature Switzerland, Cham, pp 293\u2013305. 10.1007\/978-3-031-28999-6_19","key":"6323_CR24","DOI":"10.1007\/978-3-031-28999-6_19"},{"issue":"6","key":"6323_CR25","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1080\/095372899232894","volume":"10","author":"JND Gupta","year":"1999","unstructured":"Gupta, J. N. D., & Ho, J. C. (1999). A new heuristic algorithm for the one-dimensional bin-packing problem. Production Planning & Control, 10(6), 598\u2013603. https:\/\/doi.org\/10.1080\/095372899232894","journal-title":"Production Planning & Control"},{"issue":"6","key":"6323_CR26","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1080\/03610928008827904","volume":"9","author":"RL Iman","year":"1980","unstructured":"Iman, R. L., & Davenport, J. M. (1980). Approximations of the critical region of the fbietkan statistic. Communications in Statistics-Theory and Methods, 9(6), 571\u2013595. https:\/\/doi.org\/10.1080\/03610928008827904","journal-title":"Communications in Statistics-Theory and Methods"},{"key":"6323_CR27","volume-title":"Matematicheskie Metody Organizatsii I Planirovaniya Proizvodstva [Mathematical Methods of Organizing and Planning Production]","author":"L Kantorovich","year":"1939","unstructured":"Kantorovich, L. (1939). Matematicheskie Metody Organizatsii I Planirovaniya Proizvodstva [Mathematical Methods of Organizing and Planning Production]. Leningrad: Lenizdat."},{"key":"6323_CR28","volume-title":"Ratsionalnyj raskroj promyshlennykh materialov [Calculation of Rational Cutting of Stock]","author":"L Kantorovich","year":"1951","unstructured":"Kantorovich, L., & Zalgaller, V. (1951). Ratsionalnyj raskroj promyshlennykh materialov [Calculation of Rational Cutting of Stock]. Leningrad: Lenizdat."},{"doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among Combinatorial Problems, Springer US, Boston, MA, pp 85\u2013103. 10.1007\/978-1-4684-2001-2_9","key":"6323_CR29","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"6323_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-022-01785-9","volume":"197","author":"VL de Lima","year":"2022","unstructured":"de Lima, V. L., Iori, M., & Miyazawa, F. K. (2022). Exact solution of network flow models with strong relaxations. Mathematical Programming, 197, 1\u201334. https:\/\/doi.org\/10.1007\/s10107-022-01785-9","journal-title":"Mathematical Programming"},{"issue":"7","key":"6323_CR31","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.cor.2006.10.021","volume":"35","author":"KH Loh","year":"2008","unstructured":"Loh, K. H., Golden, B., & Wasil, E. (2008). Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research, 35(7), 2283\u20132291. https:\/\/doi.org\/10.1016\/j.cor.2006.10.021","journal-title":"Computers & Operations Research"},{"key":"6323_CR32","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. John Wiley & Sons Inc."},{"issue":"11","key":"6323_CR33","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097\u20131100. https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Computers & Operations Research"},{"unstructured":"Nemenyi PB (1963) Distribution-free multiple comparisons. PhD thesis, Princeton University","key":"6323_CR34"},{"issue":"1","key":"6323_CR35","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10107-020-01523-z","volume":"183","author":"A Pessoa","year":"2020","unstructured":"Pessoa, A., Sadykov, R., Uchoa, E., et al. (2020). A generic exact solver for vehicle routing and related problems. Mathematical Programming, 183(1), 483\u2013523. https:\/\/doi.org\/10.1007\/s10107-020-01523-z","journal-title":"Mathematical Programming"},{"unstructured":"Uchoa E, Sadykov R (2024) Kantorovich and Zalgaller (1951): The 0-th column generation algorithm. Tech. Rep. L-2024-1, Cadernos do LOGIS-UFF, Niter\u00f3i, Brazil","key":"6323_CR36"},{"issue":"3","key":"6323_CR37","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"PH Vance","year":"1998","unstructured":"Vance, P. H. (1998). Branch-and-price algorithms for the one-dimensional cutting stock problem. Computational Optimization and Applications, 9(3), 211\u2013228. https:\/\/doi.org\/10.1023\/A:1018346107246","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"6323_CR38","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1287\/ijoc.2018.0867","volume":"32","author":"L Wei","year":"2020","unstructured":"Wei, L., Luo, Z., Baldacci, R., et al. (2020). A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. INFORMS Journal on Computing, 32(2), 428\u2013443. https:\/\/doi.org\/10.1287\/ijoc.2018.0867","journal-title":"INFORMS Journal on Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06323-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06323-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06323-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:10:29Z","timestamp":1733515829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06323-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6323"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06323-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"5 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}