{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:42:15Z","timestamp":1775054535573,"version":"3.50.1"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030179526","type":"print"},{"value":"9783030179533","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17953-3_27","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:25:20Z","timestamp":1556753120000},"page":"354-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A Generic Exact Solver for Vehicle Routing and Related Problems"],"prefix":"10.1007","author":[{"given":"Artur","family":"Pessoa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruslan","family":"Sadykov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Vanderbeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"issue":"4\u20135","key":"27_CR1","doi-asserted-by":"publisher","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":"6","key":"27_CR2","doi-asserted-by":"publisher","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."},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","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":"27_CR4","doi-asserted-by":"publisher","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":"27_CR5","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.: 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":"27_CR6","doi-asserted-by":"publisher","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":"27_CR7","doi-asserted-by":"publisher","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":"27_CR8","doi-asserted-by":"publisher","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":"27_CR9","doi-asserted-by":"publisher","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":"27_CR10","doi-asserted-by":"publisher","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":"27_CR11","doi-asserted-by":"publisher","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":"27_CR12","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.: 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":"2","key":"27_CR13","doi-asserted-by":"publisher","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":"27_CR14","doi-asserted-by":"publisher","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."},{"key":"27_CR15","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.: Bin packing and related problems: general arc-flow formulation with graph compression. Comput. Oper. Res. 69, 56\u201367 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","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."},{"key":"27_CR17","doi-asserted-by":"publisher","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":"27_CR18","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.: 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":"27_CR19","doi-asserted-by":"publisher","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":"27_CR20","doi-asserted-by":"publisher","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":"27_CR21","first-page":"315","volume-title":"Combinatorial Optimization","author":"N Christofides","year":"1979","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P. (eds.) Combinatorial Optimization, pp. 315\u2013338. Wiley, Chichester (1979)"},{"issue":"2","key":"27_CR22","doi-asserted-by":"publisher","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":"27_CR23","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.: 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":"27_CR24","doi-asserted-by":"publisher","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":"27_CR25","doi-asserted-by":"publisher","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":"27_CR26","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.: 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":"27_CR27","series-title":"Centre for Research on Transportation","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-1-4615-5755-5_3","volume-title":"Fleet Management and Logistics","author":"G Desaulniers","year":"1998","unstructured":"Desaulniers, G., Desrosiers, J., loachim, I., Solomon, M.M., Soumis, F., Villeneuve, D.: A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics. CRT, pp. 57\u201393. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4615-5755-5_3"},{"issue":"3","key":"27_CR28","doi-asserted-by":"publisher","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":"27_CR29","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.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"issue":"11","key":"27_CR30","doi-asserted-by":"publisher","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":"27_CR31","doi-asserted-by":"publisher","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":"27_CR32","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heurist. 2, 5\u201330 (1996)","journal-title":"J. Heurist."},{"issue":"3","key":"27_CR33","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R Fukasawa","year":"2006","unstructured":"Fukasawa, R., et al.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106(3), 491\u2013511 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"27_CR34","doi-asserted-by":"publisher","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. Heurist. 8(3), 251\u2013276 (2002)","journal-title":"J. Heurist."},{"issue":"2","key":"27_CR35","doi-asserted-by":"publisher","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":"27_CR36","unstructured":"Gurobi Optimization, Inc.: Gurobi optimizer reference manual, version 7.5 (2017). http:\/\/www.gurobi.com"},{"issue":"2","key":"27_CR37","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.: 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":"2","key":"27_CR38","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.: 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":"27_CR39","doi-asserted-by":"publisher","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."},{"issue":"2","key":"27_CR40","doi-asserted-by":"publisher","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":"02","key":"27_CR41","doi-asserted-by":"publisher","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"},{"key":"27_CR42","unstructured":"Lysgaard, J.: CVRPSEP: a package of separation routines for the capacitated vehicle routing problem. Aarhus School of Business, Department of Management Science and Logistics (2003)"},{"issue":"2","key":"27_CR43","doi-asserted-by":"publisher","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."},{"issue":"3","key":"27_CR44","doi-asserted-by":"publisher","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."},{"key":"27_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-319-07557-0_33","volume-title":"Integer Programming and Combinatorial Optimization","author":"D Pecin","year":"2014","unstructured":"Pecin, D., Pessoa, A., Poggi, M., Uchoa, E.: Improved branch-cut-and-price for capacitated vehicle routing. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 393\u2013403. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07557-0_33"},{"issue":"3","key":"27_CR46","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.: 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."},{"issue":"1","key":"27_CR47","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.: 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":"27_CR48","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.: Limited memory rank-1 cuts for vehicle routing problems. Oper. Res. Lett. 45(3), 206\u2013209 (2017)","journal-title":"Oper. Res. Lett."},{"key":"27_CR49","doi-asserted-by":"crossref","unstructured":"Pecin, D., Uchoa, E.: Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm. Transp. Sci. (2019, to appear)","DOI":"10.1287\/trsc.2019.0900"},{"key":"27_CR50","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.: 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":"27_CR51","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.: 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":"27_CR52","unstructured":"Poggi de Arag\u00e3o, M., Uchoa, E.: Integer program reformulation for robust branch-and-cut-and-price. In: Wolsey, L. (ed.) Annals of Mathematical Programming in Rio, B\u00fazios, Brazil, pp. 56\u201361 (2003)"},{"key":"27_CR53","doi-asserted-by":"publisher","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":"27_CR54","doi-asserted-by":"publisher","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":"27_CR55","unstructured":"R\u00f8pke, S.: Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. In: Presentation in Column Generation 2012 (2012)"},{"issue":"3","key":"27_CR56","doi-asserted-by":"publisher","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":"27_CR57","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":"27_CR58","unstructured":"Sadykov, R., Uchoa, E., Pessoa, A.: A bucket graph based labeling algorithm with application to vehicle routing. Technical report L-2017-7, Cadernos do LOGIS-UFF, Niter\u00f3i, Brazil, October 2017"},{"key":"27_CR59","doi-asserted-by":"crossref","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. (2018)","DOI":"10.1287\/ijoc.2018.0822"},{"key":"27_CR60","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":"27_CR61","doi-asserted-by":"publisher","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":"27_CR62","doi-asserted-by":"publisher","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":"27_CR63","unstructured":"Vanderbeck, F., Sadykov, R., Tahiri, I.: BaPCod \u2013 a generic Branch-And-Price Code (2018). https:\/\/realopt.bordeaux.inria.fr\/?page_id=2"},{"key":"27_CR64","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-68279-0_13","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"F Vanderbeck","year":"2010","unstructured":"Vanderbeck, F., Wolsey, L.A.: Reformulation and decomposition of integer programs. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 431\u2013502. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_13"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17953-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:43:25Z","timestamp":1709815405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17953-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179526","9783030179533"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17953-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ann Arbor, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/umich.edu\/~ipco2019conf\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}