{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T06:57:56Z","timestamp":1786085876519,"version":"3.56.0"},"reference-count":85,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"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\/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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10107-020-01523-z","type":"journal-article","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T13:02:43Z","timestamp":1593090163000},"page":"483-523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":169,"title":["A generic exact solver for vehicle routing and related problems"],"prefix":"10.1007","volume":"183","author":[{"given":"Artur","family":"Pessoa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruslan","family":"Sadykov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8687-2613","authenticated-orcid":false,"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fran\u00e7ois","family":"Vanderbeck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,25]]},"reference":[{"key":"1523_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universitat Berlin (2007)"},{"issue":"4\u20135","key":"1523_CR2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.dam.2011.12.021","volume":"161","author":"C Archetti","year":"2013","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.: Optimal solutions for routing problems with profits. Discrete Appl. Math. 161(4\u20135), 547\u2013557 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"1523_CR3","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10589-008-9183-8","volume":"45","author":"P Avella","year":"2010","unstructured":"Avella, P., Boccia, M., Vasilyev, I.: A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45(3), 543\u2013555 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1523_CR4","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/opre.1100.0881","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Bartolini, E., Mingozzi, A.: An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2), 414\u2013426 (2011)","journal-title":"Oper. Res."},{"key":"1523_CR5","unstructured":"Boost C++ libraries (2019). https:\/\/www.boost.org\/"},{"key":"1523_CR6","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115, 351\u2013385 (2008)","journal-title":"Math. Program."},{"issue":"2","key":"1523_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R Baldacci","year":"2009","unstructured":"Baldacci, R., Mingozzi, A.: A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120(2), 347\u2013380 (2009)","journal-title":"Math. Program."},{"issue":"5","key":"1523_CR8","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5), 1269\u20131283 (2011)","journal-title":"Oper. Res."},{"issue":"2","key":"1523_CR9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M Balinski","year":"1964","unstructured":"Balinski, M., Quandt, R.: On an integer program for a delivery problem. Oper. Res. 12(2), 300\u2013304 (1964)","journal-title":"Oper. Res."},{"issue":"1","key":"1523_CR10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-011-0497-4","volume":"137","author":"E Bartolini","year":"2013","unstructured":"Bartolini, E., Cordeau, J.F., Laporte, G.: Improved lower bounds and exact algorithm for the capacitated arc routing problem. Math. Program. 137(1), 409\u2013452 (2013)","journal-title":"Math. Program."},{"issue":"11","key":"1523_CR11","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"1523_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1018316919294","volume":"10","author":"J Belenguer","year":"1998","unstructured":"Belenguer, J., Benavent, E.: The capacitated arc routing problem: Valid inequalities and facets. Comput. Optim. Appl. 10(2), 165\u2013187 (1998)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1523_CR13","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":"1","key":"1523_CR14","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/net.21520","volume":"63","author":"E Benavent","year":"2014","unstructured":"Benavent, E., Corber\u00e1n, \u00c1., Desaulniers, G., Lessard, F., Plana, I., Sanchis, J.M.: A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem. Networks 63(1), 34\u201345 (2014)","journal-title":"Networks"},{"issue":"2","key":"1523_CR15","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1111\/itor.12422","volume":"25","author":"N Bianchessi","year":"2018","unstructured":"Bianchessi, N., Mansini, R., Speranza, M.G.: A branch-and-cut algorithm for the team orienteering problem. Int. Trans. Oper. Res. 25(2), 627\u2013635 (2018)","journal-title":"Int. Trans. Oper. Res."},{"issue":"5","key":"1523_CR16","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1287\/opre.1120.1079","volume":"60","author":"C Bode","year":"2012","unstructured":"Bode, C., Irnich, S.: Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper. Res. 60(5), 1167\u20131182 (2012)","journal-title":"Oper. Res."},{"issue":"6","key":"1523_CR17","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1057\/palgrave.jors.2602603","volume":"60","author":"C Archetti","year":"2009","unstructured":"Archetti, C., Feillet, D., Hertz, A., Speranza, M.G.: The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6), 831\u2013842 (2009)","journal-title":"J. Oper. Res. Soc."},{"key":"1523_CR18","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cor.2015.11.009","volume":"69","author":"F Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, F.: Pedroso, JaP: bin packing and related problems\u2014general arc-flow formulation with graph compression. Comput. Oper. Res. 69, 56\u201367 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1523_CR19","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/j.ejor.2017.08.027","volume":"265","author":"T Bulhoes","year":"2018","unstructured":"Bulhoes, T., H\u00e0, M.H., Martinelli, R., Vidal, T.: The vehicle routing problem with service level constraints. Eur. J. Oper. Res. 265(2), 544\u2013558 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1523_CR20","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.orl.2018.04.006","volume":"46","author":"T Bulh\u00f5es","year":"2018","unstructured":"Bulh\u00f5es, T., Pessoa, A., Protti, F., Uchoa, E.: On the complete set packing and set partitioning polytopes: properties and rank 1 facets. Oper. Res. Lett. 46(4), 389\u2013392 (2018)","journal-title":"Oper. Res. Lett."},{"key":"1523_CR21","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.cor.2018.01.016","volume":"93","author":"T Bulhoes","year":"2018","unstructured":"Bulhoes, T., Sadykov, R., Uchoa, E.: A branch-and-price algorithm for the minimum latency problem. Comput. Oper. Res. 93, 66\u201378 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1523_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0166-218X(00)00267-5","volume":"111","author":"A Caprara","year":"2001","unstructured":"Caprara, A., Toth, P.: Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Appl. Math. 111(3), 231\u2013262 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"1523_CR23","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464\u2013474 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"1523_CR24","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. Oper. Res. Q. 20, 309\u2013318 (1969)","journal-title":"Oper. Res. Q."},{"key":"1523_CR25","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: Combinatorial Optimization, chap. The Vehicle Routing Problem, pp. 315\u2013338. Wiley, Chichester (1979)"},{"issue":"2","key":"1523_CR26","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.ejor.2016.09.051","volume":"258","author":"F Clautiaux","year":"2017","unstructured":"Clautiaux, F., Hanafi, S., Macedo, R., \u00c9milie Voge, M., Alves, C.: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. Eur. J. Oper. Res. 258(2), 467\u2013477 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"1523_CR27","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12, 129\u2013146 (2014)","journal-title":"Discrete Optim."},{"issue":"2","key":"1523_CR28","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"JF Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105\u2013119 (1997)","journal-title":"Networks"},{"issue":"1","key":"1523_CR29","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig, G., Ramser, J.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"issue":"1","key":"1523_CR30","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/ijoc.2018.0880","volume":"32","author":"M Delorme","year":"2020","unstructured":"Delorme, M., Iori, M.: Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. INFORMS J. Comput. 32(1), 101\u2013119 (2020)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1523_CR31","doi-asserted-by":"crossref","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.: Bin packing and cutting stock problems: Mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1), 1\u201320 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"1523_CR32","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., loachim, I., Solomon, M.M., Soumis, F., Villeneuve, D., et\u00a0al.: A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Fleet Management and Logistics, pp. 57\u201393. Springer (1998)","DOI":"10.1007\/978-1-4615-5755-5_3"},{"issue":"3","key":"1523_CR33","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers, G., Lessard, F., Hadjar, A.: Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transp. Sci. 42(3), 387\u2013404 (2008)","journal-title":"Transp. Sci."},{"issue":"2","key":"1523_CR34","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"issue":"11","key":"1523_CR35","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1057\/jors.1992.160","volume":"43","author":"RW Eglese","year":"1992","unstructured":"Eglese, R.W., Li, L.Y.O.: Efficient routeing for winter gritting. J. Oper. Res. Soc. 43(11), 1031\u20131034 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"1523_CR36","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.cor.2016.04.008","volume":"74","author":"R El-Hajj","year":"2016","unstructured":"El-Hajj, R., Dang, D.C., Moukrim, A.: Solving the team orienteering problem with cutting planes. Comput. Oper. Res. 74, 21\u201330 (2016)","journal-title":"Comput. Oper. Res."},{"key":"1523_CR37","doi-asserted-by":"crossref","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, 5\u201330 (1996)","journal-title":"J. Heuristics"},{"key":"1523_CR38","doi-asserted-by":"crossref","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., Arag\u00e3o, MPd, Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106(3), 491\u2013511 (2006)","DOI":"10.1007\/s10107-005-0644-x"},{"issue":"3","key":"1523_CR39","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1015053600842","volume":"8","author":"H Gehring","year":"2002","unstructured":"Gehring, H., Homberger, J.: Parallelization of a two-phase metaheuristic for routing problems with time windows. J. Heuristics 8(3), 251\u2013276 (2002)","journal-title":"J. Heuristics"},{"issue":"1","key":"1523_CR40","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02098283","volume":"61","author":"S G\u00e9linas","year":"1995","unstructured":"G\u00e9linas, S., Desrochers, M., Desrosiers, J., Solomon, M.M.: A new branching strategy for time constrained routing problems with application to backhauling. Ann. Oper. Res. 61(1), 91\u2013109 (1995)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"1523_CR41","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1016\/j.ejor.2017.04.061","volume":"262","author":"L Gouveia","year":"2017","unstructured":"Gouveia, L., Leitner, M., Ruthmair, M.: Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem. Eur. J. Oper. Res. 262(3), 908\u2013928 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1523_CR42","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.ejor.2017.09.035","volume":"266","author":"T Gschwind","year":"2018","unstructured":"Gschwind, T., Irnich, S., Rothenb\u00e4cher, A.K., Tilk, C.: Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems. Eur. J. Oper. Res. 266(2), 521\u2013530 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1523_CR43","unstructured":"Gurobi\u00a0Optimization, L.: Gurobi optimizer reference manual, version 7.5 (2017). http:\/\/www.gurobi.com"},{"issue":"4","key":"1523_CR44","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s12532-012-0042-3","volume":"4","author":"S Held","year":"2012","unstructured":"Held, S., Cook, W., Sewell, E.C.: Maximum-weight stable sets and safe lower bounds for graph coloring. Math. Program. Comput. 4(4), 363\u2013381 (2012)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1523_CR45","doi-asserted-by":"crossref","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.: Stabilized branch-and-price algorithms for vector packing problems. Eur. J. Oper. Res. 271(2), 401\u2013419 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1523_CR46","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00291-007-0083-6","volume":"30","author":"S Irnich","year":"2008","unstructured":"Irnich, S.: Resource extension functions: Properties, inversion, and generalization to segments. OR Spectrum 30(1), 113\u2013148 (2008)","journal-title":"OR Spectrum"},{"issue":"2","key":"1523_CR47","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/ijoc.1090.0341","volume":"22","author":"S Irnich","year":"2010","unstructured":"Irnich, S., Desaulniers, G., Desrosiers, J., Hadjar, A.: Path-reduced costs for eliminating arcs in routing and scheduling. INFORMS J. Comput. 22(2), 297\u2013313 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1523_CR48","doi-asserted-by":"crossref","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.: Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2), 497\u2013511 (2008)","journal-title":"Oper. Res."},{"issue":"5","key":"1523_CR49","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","volume":"33","author":"B Kallehauge","year":"2006","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.: Lagrangian duality applied to the vehicle routing problem with time windows. Comput. Oper. Res. 33(5), 1464\u20131487 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1523_CR50","unstructured":"Kullmann, O.: Handbook of Satisfiability, chap. Fundaments of branching heuristics, pp. 205\u2013244. IOS Press, Amsterdam (2009)"},{"issue":"2","key":"1523_CR51","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01720015","volume":"5","author":"G Laporte","year":"1983","unstructured":"Laporte, G., Nobert, Y.: A branch and bound algorithm for the capacitated vehicle routing problem. Oper. Res. Spektrum 5(2), 77\u201385 (1983)","journal-title":"Oper. Res. Spektrum"},{"issue":"1","key":"1523_CR52","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10107-016-1101-8","volume":"166","author":"P Le Bodic","year":"2017","unstructured":"Le Bodic, P., Nemhauser, G.: An abstract model for branching and its application to mixed integer programming. Math. Program. 166(1), 369\u2013405 (2017)","journal-title":"Math. Program."},{"key":"1523_CR53","unstructured":"LEMON: Library for Efficient Modeling and Optimization in Networks (2014). https:\/\/lemon.cs.elte.hu\/trac\/lemon"},{"issue":"02","key":"1523_CR54","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1142\/S0218213003001186","volume":"12","author":"H Li","year":"2003","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. Int. J. Artif. Intell. Tools 12(02), 173\u2013186 (2003)","journal-title":"Int. J. Artif. Intell. Tools"},{"issue":"6","key":"1523_CR55","doi-asserted-by":"crossref","first-page":"1823","DOI":"10.1016\/j.cor.2004.11.020","volume":"33","author":"H Longo","year":"2006","unstructured":"Longo, H., De Arag\u00e3o, M.P., Uchoa, E.: Solving capacitated arc routing problems using a transformation to the cvrp. Comput. Oper. Res. 33(6), 1823\u20131837 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1523_CR56","unstructured":"Lysgaard, J.: CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Technical report 03-04 Department of Management Science and Logistics, Aarhus School of Business (2003)"},{"issue":"2","key":"1523_CR57","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2), 423\u2013445 (2004)","journal-title":"Math. Program."},{"key":"1523_CR58","doi-asserted-by":"crossref","first-page":"104833","DOI":"10.1016\/j.cor.2019.104833","volume":"114","author":"G Marques","year":"2020","unstructured":"Marques, G., Sadykov, R., Deschamps, J.C., Dupas, R.: An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Comput. Oper. Res. 114, 104833 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1523_CR59","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/ijoc.15.3.249.16075","volume":"15","author":"RM Nauss","year":"2003","unstructured":"Nauss, R.M.: Solving the generalized assignment problem: An optimizing and heuristic approach. INFORMS J. Comput. 15(3), 249\u2013266 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1523_CR60","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s00186-018-0649-x","volume":"89","author":"A Parmentier","year":"2019","unstructured":"Parmentier, A.: Algorithms for non-linear and stochastic resource constrained shortest path. Math. Methods Oper. Res. 89(2), 281\u2013317 (2019)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"1523_CR61","doi-asserted-by":"crossref","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.: New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J. Comput. 29(3), 489\u2013502 (2017)","journal-title":"INFORMS J. Comput."},{"key":"1523_CR62","doi-asserted-by":"crossref","unstructured":"Pecin, D., Pessoa, A., Poggi, M., Uchoa, E.: Improved branch-cut-and-price for capacitated vehicle routing. In: Proceedings of the XVII IPCO, Lecture Notes in Computer Science, vol. 8494, pp. 393\u2013403. Springer (2014)","DOI":"10.1007\/978-3-319-07557-0_33"},{"issue":"1","key":"1523_CR63","doi-asserted-by":"crossref","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.: Improved branch-cut-and-price for capacitated vehicle routing. Math. Program. Comput. 9(1), 61\u2013100 (2017)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"1523_CR64","doi-asserted-by":"crossref","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.: Limited memory rank-1 cuts for vehicle routing problems. Oper. Res. Lett. 45(3), 206\u2013209 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"1523_CR65","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1287\/trsc.2019.0900","volume":"53","author":"D Pecin","year":"2019","unstructured":"Pecin, D., Uchoa, E.: Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm. Transp. Sci. 53(6), 1501\u20131799 (2019)","journal-title":"Transp. Sci."},{"key":"1523_CR66","doi-asserted-by":"crossref","unstructured":"Pessoa, A., Poss, M., Sadykov, R., Vanderbeck, F.: Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty. Oper. Res. (Forthcoming) (2020)","DOI":"10.1287\/opre.2020.2035"},{"key":"1523_CR67","doi-asserted-by":"crossref","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.: Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems. Eur. J. Oper. Res. 270, 530\u2013543 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1523_CR68","doi-asserted-by":"crossref","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.: Automation and combination of linear-programming based stabilization techniques in column generation. INFORMS J. Comput. 30(2), 339\u2013360 (2018)","journal-title":"INFORMS J. Comput."},{"key":"1523_CR69","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/978-3-030-17953-3_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Pessoa","year":"2019","unstructured":"Pessoa, A., Sadykov, R., Uchoa, E., Vanderbeck, F.: A generic exact solver for vehicle routing and related problems. In: Lodi, A., Nagarajan, V. (eds.) Integer Programming and Combinatorial Optimization, vol. 11480, pp. 354\u2013369. Springer, Berlin (2019)"},{"key":"1523_CR70","doi-asserted-by":"crossref","unstructured":"Petersen, B., Pisinger, D., Spoorendonk, S.: Chv\u00e1tal-gomory rank-1 cuts used in a dantzig-wolfe decomposition of the vehicle routing problem with time windows. In: Golden BL, Raghavan S, Wasil EA, (eds) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 397\u2013419. Springer, Berlin (2008)","DOI":"10.1007\/978-0-387-77778-8_18"},{"key":"1523_CR71","unstructured":"Poggi de Arag\u00e3o, M., Uchoa, E.: Integer program reformulation for robust branch-and-cut-and-price. In: L.\u00a0Wolsey (ed.) Annals of Mathematical Programming in Rio, pp. 56\u201361. B\u00fazios, Brazil (2003)"},{"key":"1523_CR72","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10589-011-9432-0","volume":"52","author":"M Posta","year":"2012","unstructured":"Posta, M., Ferland, J.A., Michelon, P.: An exact method with variable fixing for solving the generalized assignment problem. Comput. Optim. Appl. 52, 629\u2013644 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1523_CR73","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini, G., Salani, M.: Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3), 255\u2013273 (2006)","journal-title":"Discrete Optim."},{"issue":"3","key":"1523_CR74","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1287\/trsc.2013.0474","volume":"48","author":"R Roberti","year":"2014","unstructured":"Roberti, R., Mingozzi, A.: Dynamic ng-path relaxation for the delivery man problem. Transp. Sci. 48(3), 413\u2013424 (2014)","journal-title":"Transp. Sci."},{"key":"1523_CR75","volume-title":"Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems","author":"S R\u00f8pke","year":"2012","unstructured":"R\u00f8pke, S.: Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. Presentation in International Workshop on Column Generation, Bromont, Canada (2012)"},{"issue":"3","key":"1523_CR76","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke, S., Cordeau, J.F.: Branch and cut and price for the pickup and delivery problem with time windows. Transp. Sci. 43(3), 267\u2013286 (2009)","journal-title":"Transp. Sci."},{"key":"1523_CR77","first-page":"269","volume-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","author":"DM Ryan","year":"1981","unstructured":"Ryan, D.M., Foster, B.A.: An integer programming approach to scheduling. In: Wren, A. (ed.) Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling, pp. 269\u2013280. North-Holland, Amsterdam (1981)"},{"key":"1523_CR78","doi-asserted-by":"crossref","unstructured":"Sadykov, R., Uchoa, E., Pessoa, A.: A bucket graph based labeling algorithm with application to vehicle routing. Transp. Sci. (Forthcoming) (2020)","DOI":"10.1287\/trsc.2020.0985"},{"issue":"2","key":"1523_CR79","doi-asserted-by":"crossref","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.: Primal heuristics for branch-and-price: the assets of diving methods. INFORMS J. Comput. 31(2), 251\u2013267 (2019)","journal-title":"INFORMS J. Comput."},{"key":"1523_CR80","unstructured":"Schoenfield, J.E.: Fast, exact solution of open bin packing problems without linear programming. Technical report, US Army Space and Missile Defense Command (2002)"},{"issue":"2","key":"1523_CR81","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"3","key":"1523_CR82","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Subramanian, A., Vidal, T.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845\u2013858 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"1523_CR83","unstructured":"Vanderbeck, F., Sadykov, R., Tahiri, I.: BaPCod \u2014 a generic Branch-And-Price Code (2018). https:\/\/realopt.bordeaux.inria.fr\/?page_id=2"},{"key":"1523_CR84","doi-asserted-by":"crossref","unstructured":"Vanderbeck, F., Wolsey, L.A.: Reformulation and decomposition of integer programs. In: 50 Years of Integer Programming 1958-2008, pp. 431\u2013502. Springer (2010)","DOI":"10.1007\/978-3-540-68279-0_13"},{"issue":"2","key":"1523_CR85","doi-asserted-by":"crossref","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.: A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. INFORMS J. Comput. 32(2), 428\u2013443 (2020)","journal-title":"INFORMS J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01523-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01523-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01523-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T23:57:00Z","timestamp":1624579020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01523-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,25]]},"references-count":85,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1523"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01523-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,25]]},"assertion":[{"value":"4 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}