{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:16:17Z","timestamp":1765610177351,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T00:00:00Z","timestamp":1617840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T00:00:00Z","timestamp":1617840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["313601\/2018-6"],"award-info":[{"award-number":["313601\/2018-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["E-26\/202.887\/2017"],"award-info":[{"award-number":["E-26\/202.887\/2017"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["PrInt UFF 88881"],"award-info":[{"award-number":["PrInt UFF 88881"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s43069-020-00047-8","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:02:48Z","timestamp":1637240568000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Solving Bin Packing Problems Using VRPSolver Models"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7421-4744","authenticated-orcid":false,"given":"Artur","family":"Pessoa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4862-2226","authenticated-orcid":false,"given":"Ruslan","family":"Sadykov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8687-2613","authenticated-orcid":false,"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,8]]},"reference":[{"issue":"4","key":"47_CR1","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1016\/j.cor.2006.08.014","volume":"35","author":"C Alves","year":"2008","unstructured":"Alves C, de Carvalho JMV (2008) A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput Oper Res 35(4):1315\u20131328","journal-title":"Comput Oper Res"},{"issue":"2","key":"47_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"ACF Alvim","year":"2004","unstructured":"Alvim ACF, Ribeiro CC, Glover F, Aloise DJ (2004) A hybrid improvement heuristic for the one-dimensional bin packing problem. J Heuristics 10 (2):205\u2013229","journal-title":"J Heuristics"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Program 115:351\u2013385","journal-title":"Math Program"},{"issue":"1","key":"47_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-012-1283-2","volume":"222","author":"MM Baldi","year":"2014","unstructured":"Baldi MM, Crainic TG, Perboli G, Tadei R (2014) Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items. Ann Oper Res 222(1):125\u2013141","journal-title":"Ann Oper Res"},{"issue":"1","key":"47_CR5","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. Eur J Oper Res 171(1):85\u2013106","journal-title":"Eur J Oper Res"},{"key":"47_CR6","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 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"},{"issue":"3","key":"47_CR7","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"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret Optim 12:129\u2013146","journal-title":"Discret Optim"},{"issue":"4","key":"47_CR9","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1287\/trsc.2018.0878","volume":"53","author":"L Costa","year":"2019","unstructured":"Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transp Sci 53(4):946\u2013985","journal-title":"Transp Sci"},{"issue":"1","key":"47_CR10","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 J Comput 32(1):101\u2013119","journal-title":"INFORMS J Comput"},{"issue":"1","key":"47_CR11","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":"2","key":"47_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning I, Huchette J, Lubin M (2017) JuMP: A modeling language for mathematical optimization. SIAM Rev 59(2):295\u2013320","journal-title":"SIAM Rev"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuristics 2:5\u201330","journal-title":"J Heuristics"},{"issue":"1","key":"47_CR14","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. Mathematical programming 91(1):11\u201331","journal-title":"Mathematical programming"},{"issue":"1","key":"47_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02098283","volume":"61","author":"S G\u00e9linas","year":"1995","unstructured":"G\u00e9linas S, Desrochers M, Desrosiers J, Solomon MM (1995) A new branching strategy for time constrained routing problems with application to backhauling. Ann Oper Res 61(1):91\u2013109","journal-title":"Ann Oper Res"},{"issue":"6","key":"47_CR16","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper Res 9(6):849\u2013859","journal-title":"Oper Res"},{"issue":"2","key":"47_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10589-009-9276-z","volume":"48","author":"M Haouari","year":"2011","unstructured":"Haouari M, Serairi M (2011) Relaxations and exact solution of the variable sized bin packing problem. Comput Optim Appl 48(2):345\u2013368","journal-title":"Comput Optim Appl"},{"issue":"4","key":"47_CR18","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s12532-012-0042-3","volume":"4","author":"S Held","year":"2012","unstructured":"Held S, Cook W, Sewell EC (2012) Maximum-weight stable sets and safe lower bounds for graph coloring. Math Program Comput 4(4):363\u2013381","journal-title":"Math Program Comput"},{"issue":"2","key":"47_CR19","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.047","volume":"271","author":"K Hessler","year":"2018","unstructured":"Hessler 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"},{"doi-asserted-by":"crossref","unstructured":"Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Column generation. Springer, pp 33\u201365","key":"47_CR20","DOI":"10.1007\/0-387-25486-2_2"},{"issue":"2","key":"47_CR21","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper Res 56(2):497\u2013511","journal-title":"Oper Res"},{"issue":"4","key":"47_CR22","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"LV Kantorovich","year":"1960","unstructured":"Kantorovich LV (1960) Mathematical methods of organizing and planning production. Manag Sci 6(4):366\u2013422. Translation of a 1939 paper in Russian","journal-title":"Manag Sci"},{"doi-asserted-by":"crossref","unstructured":"Monaci M (2002) Algorithms for packing and scheduling problems. PhD thesis, University of Bologna","key":"47_CR23","DOI":"10.1007\/s10288-002-0011-1"},{"doi-asserted-by":"crossref","unstructured":"Pecin D, Pessoa A, Poggi M, Uchoa E (2014) branch-cut-and-price for capacitated vehicle routing, Springer","key":"47_CR24","DOI":"10.1007\/978-3-319-07557-0_33"},{"issue":"3","key":"47_CR25","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1287\/ijoc.2016.0744","volume":"29","author":"D Pecin","year":"2017","unstructured":"Pecin D, Contardo C, Desaulniers G, Uchoa E (2017) New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J Comput 29(3):489\u2013502","journal-title":"INFORMS J Comput"},{"issue":"1","key":"47_CR26","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s12532-016-0108-8","volume":"9","author":"D Pecin","year":"2017","unstructured":"Pecin D, Pessoa A, Poggi M, Uchoa E (2017) Improved branch-cut-and-price for capacitated vehicle routing. Math Program Comput 9(1):61\u2013100","journal-title":"Math Program Comput"},{"issue":"3","key":"47_CR27","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.orl.2017.02.006","volume":"45","author":"D Pecin","year":"2017","unstructured":"Pecin D, Pessoa A, Poggi M, Uchoa E, Santos H (2017) Limited memory rank-1 cuts for vehicle routing problems. Oper Res Lett 45 (3):206\u2013209","journal-title":"Oper Res Lett"},{"key":"47_CR28","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.ejor.2018.04.009","volume":"270","author":"A Pessoa","year":"2018","unstructured":"Pessoa A, Sadykov R, Uchoa E (2018) Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems. Eur J Oper Res 270:530\u2013543","journal-title":"Eur J Oper Res"},{"issue":"2","key":"47_CR29","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/ijoc.2017.0784","volume":"30","author":"A Pessoa","year":"2018","unstructured":"Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2018) Automation and combination of linear-programming based stabilization techniques in column generation. INFORMS J Comput 30(2):339\u2013360","journal-title":"INFORMS J Comput"},{"doi-asserted-by":"crossref","unstructured":"Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2019) A generic exact solver for vehicle routing and related problems. Technical Report L-2019-2, Cadernos do LOGIS-UFF, Niter\u00f3i, Brazil","key":"47_CR30","DOI":"10.1007\/978-3-030-17953-3_27"},{"doi-asserted-by":"crossref","unstructured":"Pessoa A, Sadykov R, Uchoa E, Vanderbeck F (2019) A generic exact solver for vehicle routing and related problems. In: International conference on integer programming and combinatorial optimization. Springer, pp 354\u2013369","key":"47_CR31","DOI":"10.1007\/978-3-030-17953-3_27"},{"key":"47_CR32","doi-asserted-by":"publisher","first-page":"xx+\u2009546","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin, p xx+\u2009546"},{"issue":"5","key":"47_CR33","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D Pisinger","year":"1997","unstructured":"Pisinger D (1997) A minimal algorithm for the 0-1 knapsack problem. Oper Res 45(5):758\u2013767","journal-title":"Oper Res"},{"unstructured":"Ryan DM, Foster BA (1981) Computer scheduling of public transport: urban passenger vehicle and crew scheduling. In: Wren A. (ed). North-Holland, pp 269\u2013280","key":"47_CR34"},{"doi-asserted-by":"crossref","unstructured":"Sadykov R, Uchoa E, Pessoa A (2020) A bucket graph based labeling algorithm with application to vehicle routing. Transp Sci, accepted","key":"47_CR35","DOI":"10.1287\/trsc.2020.0985"},{"issue":"2","key":"47_CR36","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1287\/ijoc.2018.0822","volume":"31","author":"R Sadykov","year":"2019","unstructured":"Sadykov R, Vanderbeck F, Pessoa A, Tahiri I, Uchoa E (2019) Primal heuristics for branch-and-price: the assets of diving methods. INFORMS J Comput 31(2):251\u2013267","journal-title":"INFORMS J Comput"},{"unstructured":"Schoenfield JE (2002) Fast, exact solution of open bin packing problems without linear programming. Technical report, US Army Space and Missile Defense Command","key":"47_CR37"},{"issue":"2","key":"47_CR38","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1287\/ijoc.1030.0060","volume":"17","author":"M Jos\u00e9","year":"2005","unstructured":"Jos\u00e9 M, de Carvalho V (2005) Using extra dual cuts to accelerate column generation. INFORMS J Comput 17(2):175\u2013182","journal-title":"INFORMS J Comput"},{"issue":"2","key":"47_CR39","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"},{"doi-asserted-by":"crossref","unstructured":"Vanderbeck F, Wolsey LA (2010) Reformulation and decomposition of integer programs. In: 50 years of integer programming 1958-2008. Springer, pp 431\u2013502","key":"47_CR40","DOI":"10.1007\/978-3-540-68279-0_13"},{"issue":"3","key":"47_CR41","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01539705","volume":"18","author":"G W\u00e4scher","year":"1996","unstructured":"W\u00e4scher G, Gau T (1996) Heuristics for the integer one-dimensional cutting stock problem: A computational study. Operations-Research-Spektrum 18(3):131\u2013144","journal-title":"Operations-Research-Spektrum"},{"doi-asserted-by":"crossref","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. Online First","key":"47_CR42","DOI":"10.1287\/ijoc.2018.0867"},{"issue":"1","key":"47_CR43","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"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00047-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-020-00047-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00047-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:26:31Z","timestamp":1637241991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-020-00047-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,8]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s43069-020-00047-8","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2021,4,8]]},"assertion":[{"value":"22 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interest"}}],"article-number":"20"}}