{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:46:53Z","timestamp":1767340013819,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T00:00:00Z","timestamp":1729728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T00:00:00Z","timestamp":1729728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["144257\/2019-0","312271\/2023-9","315555\/2023-8","312345\/2023-2"],"award-info":[{"award-number":["144257\/2019-0","312271\/2023-9","315555\/2023-8","312345\/2023-2"]}],"id":[{"id":"10.13039\/501100003593","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":["408722\/2023-1","313146\/2022-5"],"award-info":[{"award-number":["408722\/2023-1","313146\/2022-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2017\/11831-1","405369\/2021-2","404315\/2023-2"],"award-info":[{"award-number":["2017\/11831-1","405369\/2021-2","404315\/2023-2"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"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","2022\/05803-3","2022\/05803-3"],"award-info":[{"award-number":["2022\/05803-3","2022\/05803-3","2022\/05803-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10878-024-01221-y","type":"journal-article","created":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T18:03:35Z","timestamp":1729793015000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Algorithms for the bin packing problem with scenarios"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1865-4104","authenticated-orcid":false,"given":"Yulle G. F.","family":"Borges","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4805-4468","authenticated-orcid":false,"given":"Vin\u00edcius L.","family":"de Lima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1067-6421","authenticated-orcid":false,"given":"Fl\u00e1vio K.","family":"Miyazawa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1001-082X","authenticated-orcid":false,"given":"Lehilton L. C.","family":"Pedrosa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2674-3366","authenticated-orcid":false,"given":"Thiago A.","family":"de Queiroz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0472-4810","authenticated-orcid":false,"given":"Rafael C. S.","family":"Schouery","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,24]]},"reference":[{"key":"1221_CR1","doi-asserted-by":"crossref","unstructured":"Alves C, Val\u00c3rio de Carvalho J, Clautiaux F, Rietz J (2014) Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. Eur J Oper Res 233(1):43\u201363","DOI":"10.1016\/j.ejor.2013.08.011"},{"key":"1221_CR2","doi-asserted-by":"publisher","unstructured":"Azar Y, Cohen IR, Kamara S, Shepherd FB (2013) Tight bounds for online vector bin packing. In: Boneh D, Roughgarden T, Feigenbaum J (eds) Symposium on Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA, June 1-4, 2013, ACM, pp 961\u2013970, https:\/\/doi.org\/10.1145\/2488608.2488730,","DOI":"10.1145\/2488608.2488730"},{"issue":"1","key":"1221_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ejor.2012.12.017","volume":"227","author":"A Baghalian","year":"2013","unstructured":"Baghalian A, Rezapour S, Farahani RZ (2013) Robust supply chain network design with service level against disruptions and demand uncertainties: a real-life case. Eur J Oper Res 227(1):199\u2013215","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1221_CR4","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1016\/j.ejor.2018.10.056","volume":"274","author":"MM Baldi","year":"2019","unstructured":"Baldi MM, Manerba D, Perboli G, Tadei R (2019) A generalized bin packing problem for parcel delivery in last-mile logistics. Eur J Oper Res 274(3):990\u2013999","journal-title":"Eur J Oper Res"},{"key":"1221_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2018.11.005","volume":"102","author":"J Balogh","year":"2019","unstructured":"Balogh J, Bekesi J, D\u00f3sa G, Sgall J, van Stee R (2019) The optimal absolute ratio for online bin packing. J Comput Syst Sci 102:1\u201317","journal-title":"J Comput Syst Sci"},{"issue":"4","key":"1221_CR6","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1137\/080736831","volume":"39","author":"N Bansal","year":"2009","unstructured":"Bansal N, Caprara A, Sviridenko M (2009) A new approximation method for set covering problems, with applications to multidimensional bin packing. SIAM J Comput 39(4):1256\u20131278. https:\/\/doi.org\/10.1137\/080736831","journal-title":"SIAM J Comput"},{"key":"1221_CR7","first-page":"79","volume":"2004","author":"JD Beltr\u00e1n","year":"2004","unstructured":"Beltr\u00e1n JD, Calder\u00f3n JE, Cabrera RJ, Moreno-P\u00e9rez JA, Moreno-Vega JM (2004) Grasp-vns hybrid for the strip packing problem. Hybrid Metaheuristics 2004:79\u201390","journal-title":"Hybrid Metaheuristics"},{"key":"1221_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.dam.2018.08.023","volume":"261","author":"L Bertazzi","year":"2019","unstructured":"Bertazzi L, Golden B, Wang X (2019) The bin packing problem with item fragmentation: a worst-case analysis. Discret Appl Math 261:63\u201377","journal-title":"Discret Appl Math"},{"issue":"1","key":"1221_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10479-008-0452-9","volume":"179","author":"A Bettinelli","year":"2010","unstructured":"Bettinelli A, Ceselli A, Righini G (2010) A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. Ann Oper Res 179(1):221\u2013241","journal-title":"Ann Oper Res"},{"issue":"2","key":"1221_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10100-018-0574-3","volume":"27","author":"A B\u00f3dis","year":"2019","unstructured":"B\u00f3dis A, Balogh J (2019) Bin packing problem with scenarios. Central Eur J Oper Res 27(2):377\u2013395. https:\/\/doi.org\/10.1007\/s10100-018-0574-3","journal-title":"Central Eur J Oper Res"},{"key":"1221_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106455","volume":"144","author":"YG Borges","year":"2020","unstructured":"Borges YG, Miyazawa FK, Schouery RC, Xavier EC (2020) Exact algorithms for class-constrained packing problems. Comput Ind Eng 144:106455","journal-title":"Comput Ind Eng"},{"key":"1221_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.11.009","volume":"69","author":"F Brandao","year":"2016","unstructured":"Brandao F, Pedroso JP (2016) Bin packing and related problems: general arc-flow formulation with graph compression. Comput Oper Res 69:56\u201367","journal-title":"Comput Oper Res"},{"key":"1221_CR13","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. Comput Oper Res 76:12\u201321","journal-title":"Comput Oper Res"},{"issue":"3","key":"1221_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0166-218X(00)00267-5","volume":"111","author":"A Caprara","year":"2001","unstructured":"Caprara A, Toth P (2001) Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret Appl Math 111(3):231\u2013262","journal-title":"Discret Appl Math"},{"issue":"4","key":"1221_CR15","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C Chekuri","year":"2004","unstructured":"Chekuri C, Khanna S (2004) On multidimensional packing problems. SIAM J Comput 33(4):837\u2013851","journal-title":"SIAM J Comput"},{"key":"1221_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen HI, Khan A, Pokutta S, Tetali P (2017) Approximation and online algorithms for multidimensional bin packing: A survey. Comput Sci Rev 24:63\u201379. https:\/\/doi.org\/10.1016\/j.cosrev.2016.12.001","journal-title":"Comput Sci Rev"},{"issue":"1","key":"1221_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10479-008-0453-8","volume":"179","author":"F Clautiaux","year":"2010","unstructured":"Clautiaux F, Alves C, Val\u00e9rio de Carvalho J (2010) A survey of dual-feasible and superadditive functions. Ann Oper Res 179(1):317\u2013342","journal-title":"Ann Oper Res"},{"key":"1221_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.dam.2012.04.010","volume":"163","author":"F Clautiaux","year":"2014","unstructured":"Clautiaux F, Dell\u2019Amico M, Iori M, Khanafer A (2014) Lower and upper bounds for the bin packing problem with fragile objects. Discret Appl Math 163:73\u201386","journal-title":"Discret Appl Math"},{"key":"1221_CR19","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of combinatorial optimization","author":"EG Coffman","year":"2013","unstructured":"Coffman EG, Csirik J, Galambos G, Martello S, Vigo D (2013) Bin packing approximation algorithms: survey and classification. Handbook of combinatorial optimization. Springer, Cham, pp 455\u2013531"},{"issue":"1","key":"1221_CR20","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cie.2013.05.016","volume":"66","author":"N Dahmani","year":"2013","unstructured":"Dahmani N, Clautiaux F, Krichen S, Talbi EG (2013) Iterative approaches for solving a multi-objective 2-dimensional vector packing problem. Comput Ind Eng 66(1):158\u2013170","journal-title":"Comput Ind Eng"},{"issue":"4","key":"1221_CR21","doi-asserted-by":"publisher","first-page":"767","DOI":"10.2307\/1911818","volume":"29","author":"G Dantzig","year":"1961","unstructured":"Dantzig G, Wolfe P (1961) The decomposition algorithm for linear programs. Econometrica 29(4):767\u2013778","journal-title":"Econometrica"},{"key":"1221_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104825","volume":"114","author":"M Dell\u2019Amico","year":"2020","unstructured":"Dell\u2019Amico M, Furini F, Iori M (2020) A branch-and-price algorithm for the temporal bin packing problem. Comput Oper Res 114:104825","journal-title":"Comput Oper Res"},{"issue":"1","key":"1221_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/ijoc.2018.0880","volume":"32","author":"M Delorme","year":"2019","unstructured":"Delorme M, Iori M (2019) Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. INFORMS J Comput 32(1):101\u2013119","journal-title":"INFORMS J Comput"},{"issue":"1","key":"1221_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme M, Iori M, Martello S (2016) Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur J Oper Res 255(1):1\u201320","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1221_CR25","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"SP Fekete","year":"2001","unstructured":"Fekete SP, Schepers J (2001) New classes of fast lower bounds for bin packing problems. Math Program 91(1):11\u201331","journal-title":"Math Program"},{"issue":"4","key":"1221_CR26","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega W, Lueker GS (1981) Bin packing can be solved within $$1+\\epsilon $$ in linear time. Combinatorica 1(4):349\u2013355","journal-title":"Combinatorica"},{"key":"1221_CR27","doi-asserted-by":"crossref","unstructured":"Feuerstein E, Marchetti-Spaccamela A, Schalekamp F, Sitters R, van\u00a0der Ster S, Stougie L, van Zuylen A (2014) Scheduling over scenarios on two machines. In: International Computing and Combinatorics Conference, pp 559\u2013571","DOI":"10.1007\/978-3-319-08783-2_48"},{"issue":"7","key":"1221_CR28","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 KS (2002) New heuristics for one-dimensional bin-packing. Comput Oper Res 29(7):821\u2013839","journal-title":"Comput Oper Res"},{"issue":"1","key":"1221_CR29","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/mnsc.5.1.97","volume":"5","author":"L Ford","year":"1958","unstructured":"Ford L, Fulkerson D (1958) A suggested computation for maximal multi-commodity network flows. Manage Sci 5(1):97\u2013101","journal-title":"Manage Sci"},{"issue":"3","key":"1221_CR30","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS (1978) \u201cStrong\u2019\u2019 NP-completeness results: motivation, examples, and implications. J ACM (JACM) 25(3):499\u2013508","journal-title":"J ACM (JACM)"},{"key":"1221_CR31","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P Gilmore","year":"1961","unstructured":"Gilmore P, Gomory R (1961) A linear programming approach to the cutting stock problem. Oper Res 9:849\u2013859","journal-title":"Oper Res"},{"key":"1221_CR32","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P Gilmore","year":"1963","unstructured":"Gilmore P, Gomory R (1963) A linear programming approach to the cutting stock problem - part II. Oper Res 11:863\u2013888","journal-title":"Oper Res"},{"key":"1221_CR33","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.cie.2017.10.015","volume":"115","author":"A Grange","year":"2018","unstructured":"Grange A, Kacem I, Martin S (2018) Algorithms for the bin packing problem with overlapping items. Comput Ind Eng 115:331\u2013341","journal-title":"Comput Ind Eng"},{"key":"1221_CR34","unstructured":"Gurobi\u00a0Optimization L (2023) Gurobi optimizer reference manual. http:\/\/www.gurobi.com"},{"issue":"2","key":"1221_CR35","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.047","volume":"271","author":"K He\u00dfler","year":"2018","unstructured":"He\u00dfler K, Gschwind T, Irnich S (2018) Stabilized branch-and-price algorithms for vector packing problems. Eur J Oper Res 271(2):401\u2013419","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1221_CR36","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2016.12.021","volume":"260","author":"Q Hu","year":"2017","unstructured":"Hu Q, Zhu W, Qin H, Lim A (2017) A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function. Eur J Oper Res 260(1):70\u201380","journal-title":"Eur J Oper Res"},{"key":"1221_CR37","doi-asserted-by":"crossref","unstructured":"Juan AA, Kelton WD, Currie CS, Faulin J (2018) Simheuristics applications: dealing with uncertainty in logistics, transportation, and other supply chain areas. In: 2018 winter simulation conference (WSC), pp 3048\u20133059","DOI":"10.1109\/WSC.2018.8632464"},{"key":"1221_CR38","first-page":"363","volume":"6","author":"LV Kantorovich","year":"1960","unstructured":"Kantorovich LV (1960) Mathematical methods of organizing and planning prodution. Manag Sci 6:363\u2013422 (in Russian 1939)","journal-title":"Manag Sci"},{"key":"1221_CR39","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cie.2018.08.021","volume":"125","author":"T Kucukyilmaz","year":"2018","unstructured":"Kucukyilmaz T, Kiziloz HE (2018) Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem. Comput Ind Eng 125:157\u2013170","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1221_CR40","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee CC, Lee DT (1985) A simple on-line bin-packing algorithm. J ACM 32(3):562\u2013572. https:\/\/doi.org\/10.1145\/3828.3833","journal-title":"J ACM"},{"issue":"2","key":"1221_CR41","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s10107-022-01785-9","volume":"197","author":"VL de Lima","year":"2023","unstructured":"de Lima VL, Iori M, Miyazawa FK (2023) Exact solution of network flow models with strong relaxations. Math Program 197(2):813\u2013846. https:\/\/doi.org\/10.1007\/s10107-022-01785-9","journal-title":"Math Program"},{"issue":"11","key":"1221_CR42","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. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"3","key":"1221_CR43","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.ejor.2015.10.048","volume":"250","author":"J Pereira","year":"2016","unstructured":"Pereira J (2016) Procedures for the bin packing problem with precedence constraints. Eur J Oper Res 250(3):794\u2013806","journal-title":"Eur J Oper Res"},{"issue":"5","key":"1221_CR44","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10732-007-9048-9","volume":"14","author":"J Puchinger","year":"2008","unstructured":"Puchinger J, Raidl GR (2008) Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J Heuristics 14(5):457\u2013472","journal-title":"J Heuristics"},{"key":"1221_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2023.106430","volume":"183","author":"A Ray","year":"2024","unstructured":"Ray A (2024) There is no aptas for 2-dimensional vector bin packing: Revisited. Inf Process Lett 183:106430. https:\/\/doi.org\/10.1016\/j.ipl.2023.106430","journal-title":"Inf Process Lett"},{"key":"1221_CR46","unstructured":"Ryan DM, Foster BA (1981) An integer programming approach to scheduling. Computer scheduling of public transport urban passenger vehicle and crew scheduling pp 269\u2013280"},{"issue":"2","key":"1221_CR47","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/ijoc.1120.0499","volume":"25","author":"R Sadykov","year":"2013","unstructured":"Sadykov R, Vanderbeck F (2013) Bin packing with conflicts: a generic branch-and-price algorithm. INFORMS J Comput 25(2):244\u2013255","journal-title":"INFORMS J Comput"},{"issue":"3","key":"1221_CR48","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.ejor.2020.11.007","volume":"292","author":"M Saint-Guillain","year":"2021","unstructured":"Saint-Guillain M, Paquay C, Limbourg S (2021) Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in brussels. Eur J Oper Res 292(3):869\u2013885","journal-title":"Eur J Oper Res"},{"issue":"7","key":"1221_CR49","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1057\/jors.1992.101","volume":"43","author":"PE Sweeney","year":"1992","unstructured":"Sweeney PE, Paternoster ER (1992) Cutting and packing problems: a categorized, application-orientated research bibliography. J Oper Res Soci 43(7):691\u2013706","journal-title":"J Oper Res Soci"},{"issue":"2","key":"1221_CR50","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01300970","volume":"3","author":"PH Vance","year":"1994","unstructured":"Vance PH, Barnhart C, Johnson EL, Nemhauser GL (1994) Solving binary cutting stock problems by column generation and branch-and-bound. Comput Optim Appl 3(2):111\u2013130","journal-title":"Comput Optim Appl"},{"key":"1221_CR51","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani V (2001) Approximation Algorithms. Springer-Verlag, New York"},{"issue":"3","key":"1221_CR52","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Haussner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109\u20131130","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1221_CR53","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2019.08.024","volume":"281","author":"L Wei","year":"2020","unstructured":"Wei L, Lai M, Lim A, Hu Q (2020) A branch-and-price algorithm for the two-dimensional vector packing problem. Eur J Oper Res 281(1):25\u201335","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1221_CR54","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, Lim A (2020) A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. INFORMS J Comput 32(2):428\u2013443","journal-title":"INFORMS J Comput"},{"issue":"6","key":"1221_CR55","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(97)00179-8","volume":"64","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger GJ (1997) There is no asymptotic ptas for two-dimensional vector packing. Inf Process Lett 64(6):293\u2013297","journal-title":"Inf Process Lett"},{"key":"1221_CR56","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.tre.2016.01.004","volume":"87","author":"Xu Xy","year":"2016","unstructured":"Xy Xu, Liu J, Hy Li, Jiang M (2016) Capacity-oriented passenger flow control under uncertain demand: algorithm development and real-world case study. Transp Res Part E Logist Transp Rev 87:130\u2013148","journal-title":"Transp Res Part E Logist Transp Rev"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01221-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01221-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01221-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T12:12:06Z","timestamp":1730981526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01221-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,24]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1221"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01221-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,10,24]]},"assertion":[{"value":"5 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Author Yulle G. F. Borges declares that he has no conflict of interest. Author Vin\u00edcius L. de Lima declares that he has no Conflict of interest. Author Fl\u00e1vio K. Miyazawa declares that he has no Conflict of interest. Author Lehilton L. C. Pedrosa declares that he has no Conflict of interest. Author Thiago A. de Queiroz declares that he has no Conflict of interest. Author Rafael C. S. Schouery declares that he has no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"34"}}