{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:26:08Z","timestamp":1771503968415,"version":"3.50.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10288-025-00585-z","type":"journal-article","created":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T16:38:34Z","timestamp":1741970314000},"page":"1-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A tutorial on Branch-Price-and-Cut algorithms"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8391-0995","authenticated-orcid":false,"given":"Matteo","family":"Petris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Archetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Cattaruzza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Ogier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Semet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,14]]},"reference":[{"key":"585_CR1","unstructured":"Achterberg T (2007) Constraint integer programming. Ph.D. thesis"},{"key":"585_CR2","unstructured":"Applegate D, Bixby R, Chv\u00e1tal V et al (1995) Finding cuts in the tsp (a preliminary report). Tech. rep, Citeseer"},{"issue":"4\u20135","key":"585_CR3","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 (2013) Optimal solutions for routing problems with profits. Discrete Appl Math 161(4\u20135):547\u2013557. https:\/\/doi.org\/10.1016\/j.dam.2011.12.021","journal-title":"Discrete Appl Math"},{"issue":"5","key":"585_CR4","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 (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59(5):1269\u20131283. https:\/\/doi.org\/10.1287\/opre.1110.0975","journal-title":"Oper Res"},{"issue":"3","key":"585_CR5","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart C, Johnson EL, Nemhauser GL et al (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46(3):316\u2013329. https:\/\/doi.org\/10.1287\/opre.46.3.316","journal-title":"Oper Res"},{"issue":"4","key":"585_CR6","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"JE Beasley","year":"1989","unstructured":"Beasley JE, Christofides N (1989) An algorithm for the resource constrained shortest path problem. Networks 19(4):379\u2013394","journal-title":"Networks"},{"issue":"5","key":"585_CR7","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 (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper Res 60(5):1167\u20131182. https:\/\/doi.org\/10.1287\/opre.1120.1079","journal-title":"Oper Res"},{"issue":"1","key":"585_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.orl.2004.11.011","volume":"34","author":"N Boland","year":"2006","unstructured":"Boland N, Dethridge J, Dumitrescu I (2006) Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper Res Lett 34(1):58\u201368. https:\/\/doi.org\/10.1016\/j.orl.2004.11.011","journal-title":"Oper Res Lett"},{"issue":"2","key":"585_CR9","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.ejor.2020.01.059","volume":"285","author":"O Briant","year":"2020","unstructured":"Briant O, Cambazard H, Cattaruzza D et al (2020) An efficient and general approach for the joint order batching and picker routing problem. Eur J Oper Res 285(2):497\u2013512. https:\/\/doi.org\/10.1016\/j.ejor.2020.01.059","journal-title":"Eur J Oper Res"},{"key":"585_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer programming models","author":"M Conforti","year":"2014","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G et al (2014) Integer programming models. Springer, Berlin"},{"issue":"1","key":"585_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1287\/ijoc.2013.0549","volume":"26","author":"C Contardo","year":"2014","unstructured":"Contardo C, Cordeau JF, Gendron B (2014) An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS J Comput 26(1):88\u2013102. https:\/\/doi.org\/10.1287\/ijoc.2013.0549","journal-title":"INFORMS J Comput"},{"issue":"4","key":"585_CR12","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. https:\/\/doi.org\/10.1287\/trsc.2018.0878","journal-title":"Transp Sci"},{"issue":"2","key":"585_CR13","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1287\/ijoc.2021.1094","volume":"34","author":"L Costa","year":"2022","unstructured":"Costa L, Contardo C, Desaulniers G et al (2022) Stabilized column generation via the dynamic separation of aggregated rows. INFORMS J Comput 34(2):1141\u20131156","journal-title":"INFORMS J Comput"},{"issue":"1","key":"585_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391. https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manag Sci"},{"issue":"1","key":"585_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8(1):101\u2013111. https:\/\/doi.org\/10.1287\/opre.8.1.101","journal-title":"Oper Res"},{"issue":"4","key":"585_CR16","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393\u2013410","journal-title":"J Oper Res Soc Am"},{"key":"585_CR17","unstructured":"de\u00a0Aragao MP, Uchoa E (2003) Integer program reformulation for robust branch-and-cut-and-price algorithms. In: Mathematical program in Rio: a conference in Honour of Nelson Maculan, pp 56\u201361"},{"issue":"1","key":"585_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1287\/opre.1090.0713","volume":"58","author":"G Desaulniers","year":"2010","unstructured":"Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper Res 58(1):179\u2013192. https:\/\/doi.org\/10.1287\/opre.1090.0713","journal-title":"Oper Res"},{"key":"585_CR19","volume-title":"Column generation","author":"G Desaulniers","year":"2006","unstructured":"Desaulniers G, Desrosiers J, Solomon MM (2006) Column generation, vol 5. Springer, Berlin"},{"issue":"3","key":"585_CR20","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 (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transp Sci 42(3):387\u2013404","journal-title":"Transp Sci"},{"key":"585_CR21","unstructured":"Desrochers M (1988) An algorithm for the shortest path problem with resource constraints. \u00c9cole des hautes \u00e9tudes commerciales, Groupe d\u2019\u00e9tudes et de recherche en analyse des d\u00c3\u00a9cisions"},{"issue":"2","key":"585_CR22","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40(2):342\u2013354","journal-title":"Oper Res"},{"key":"585_CR23","doi-asserted-by":"publisher","unstructured":"Desrosiers J, L\u00fcbbecke ME (2005) A primer in column generation. In: Column generation. Springer, Berlin, pp 1\u201332. https:\/\/doi.org\/10.1007\/0-387-25486-2_1","DOI":"10.1007\/0-387-25486-2_1"},{"issue":"3","key":"585_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/net.21511","volume":"62","author":"Pugliese L Di Puglia","year":"2013","unstructured":"Di Puglia Pugliese L, Guerriero F (2013) A survey of resource constrained shortest path problems: exact solution approaches. Networks 62(3):183\u2013200. https:\/\/doi.org\/10.1002\/net.21511","journal-title":"Networks"},{"issue":"5","key":"585_CR25","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","volume":"42","author":"M Dror","year":"1994","unstructured":"Dror M (1994) Note on the complexity of the shortest path models for column generation in VRPTW. Oper Res 42(5):977\u2013978","journal-title":"Oper Res"},{"issue":"4","key":"585_CR26","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10288-010-0130-z","volume":"8","author":"D Feillet","year":"2010","unstructured":"Feillet D (2010) A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR 8(4):407\u2013424. https:\/\/doi.org\/10.1007\/s10288-010-0130-z","journal-title":"4OR"},{"issue":"3","key":"585_CR27","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M et al (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3):216\u2013229. https:\/\/doi.org\/10.1002\/net.20033","journal-title":"Networks"},{"issue":"4","key":"585_CR28","first-page":"239","volume":"45","author":"D Feillet","year":"2007","unstructured":"Feillet D, Gendreau M, Rousseau LM (2007) New refinements for the solution of vehicle routing problems with branch and price. INFOR Inf Syst Oper Res 45(4):239\u2013256","journal-title":"INFOR Inf Syst Oper Res"},{"issue":"6","key":"585_CR29","doi-asserted-by":"crossref","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"},{"key":"585_CR30","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.dam.2018.10.015","volume":"264","author":"D Goeke","year":"2019","unstructured":"Goeke D, Gschwind T, Schneider M (2019) Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier. Discrete Appl Math 264:43\u201361. https:\/\/doi.org\/10.1016\/j.dam.2018.10.015","journal-title":"Discrete Appl Math"},{"issue":"2","key":"585_CR31","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230070203","volume":"7","author":"BL Golden","year":"1977","unstructured":"Golden BL, Magnanti TL, Nguyen HQ (1977) Implementing vehicle routing algorithms. Networks 7(2):113\u2013148. https:\/\/doi.org\/10.1002\/net.3230070203","journal-title":"Networks"},{"issue":"1","key":"585_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ejor.2019.04.008","volume":"278","author":"T Gschwind","year":"2019","unstructured":"Gschwind T, Bianchessi N, Irnich S (2019) Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. Eur J Oper Res 278(1):91\u2013104. https:\/\/doi.org\/10.1016\/j.ejor.2019.04.008","journal-title":"Eur J Oper Res"},{"issue":"1","key":"585_CR33","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/ijoo.2021.0057","volume":"4","author":"N Haghani","year":"2022","unstructured":"Haghani N, Contardo C, Yarkony J (2022) Smooth and flexible dual optimal inequalities. INFORMS J Optim 4(1):29\u201344","journal-title":"INFORMS J Optim"},{"key":"585_CR34","unstructured":"He\u00dfler K, Irnich S (2022) Modeling and exact solution of picker routing and order batching problems. Technical Report LM-2022-03, Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, Mainz, Germany"},{"issue":"1","key":"585_CR35","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.ejor.2019.07.019","volume":"280","author":"T Hintsch","year":"2020","unstructured":"Hintsch T, Irnich S (2020) Exact solution of the soft-clustered vehicle-routing problem. Eur J Oper Res 280(1):164\u2013178","journal-title":"Eur J Oper Res"},{"issue":"3","key":"585_CR36","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/ijoc.1040.0117","volume":"18","author":"S Irnich","year":"2006","unstructured":"Irnich S, Villeneuve D (2006) The shortest-path problem with resource constraints and k-cycle elimination for $$k\\ge 3$$. INFORMS J Comput 18(3):391\u2013406","journal-title":"INFORMS J Comput"},{"issue":"1","key":"585_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(97)00330-5","volume":"107","author":"B Jaumard","year":"1998","unstructured":"Jaumard B, Semet F, Vovor T (1998) A generalized linear programming model for nurse scheduling. Eur J Oper Res 107(1):1\u201318","journal-title":"Eur J Oper Res"},{"key":"585_CR38","unstructured":"Jaumard B, Semet F, Vovor T (1999) A two-phase resource constrained shortest path algorithm for acyclic graphs. Cahiers du GERAD - G9648"},{"issue":"2","key":"585_CR39","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 et al (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper Res 56(2):497\u2013511. https:\/\/doi.org\/10.1287\/opre.1070.0449","journal-title":"Oper Res"},{"issue":"4","key":"585_CR40","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley JE Jr (1960) The cutting-plane method for solving convex programs. J Soc Ind Appl Math 8(4):703\u2013712","journal-title":"J Soc Ind Appl Math"},{"issue":"3","key":"585_CR41","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land AH, Doig AG (1960) An automatic method of solving discrete programming problems. Econometrica 28(3):497\u2013520","journal-title":"Econometrica"},{"issue":"1","key":"585_CR42","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10288-021-00483-0","volume":"20","author":"G Laporte","year":"2022","unstructured":"Laporte G, Toth P (2022) A gap in scientific reporting. 4OR 20(1):169\u2013171","journal-title":"4OR"},{"issue":"5","key":"585_CR43","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","volume":"33","author":"G Laporte","year":"1985","unstructured":"Laporte G, Nobert Y, Desrochers M (1985) Optimal routing under capacity and distance restrictions. Oper Res 33(5):1050\u20131073. https:\/\/doi.org\/10.1287\/opre.33.5.1050","journal-title":"Oper Res"},{"key":"585_CR44","unstructured":"Libralesso L (2020) Anytime tree search for combinatorial optimization. Ph.D. thesis, Universit\u00e9 Grenoble Alpes [2020-....]"},{"issue":"6","key":"585_CR45","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper Res 53(6):1007\u20131023. https:\/\/doi.org\/10.1287\/opre.1050.0234","journal-title":"Oper Res"},{"key":"585_CR46","doi-asserted-by":"crossref","unstructured":"Marsten RE (1975) The use of the box step method in discrete optimization. Tech. rep, National Bureau of Economic Research","DOI":"10.3386\/w0086"},{"issue":"4","key":"585_CR47","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326\u2013329. https:\/\/doi.org\/10.1145\/321043.321046","journal-title":"J ACM"},{"issue":"1","key":"585_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M Padberg","year":"1987","unstructured":"Padberg M, Rinaldi G (1987) Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper Res Lett 6(1):1\u20137","journal-title":"Oper Res Lett"},{"key":"585_CR49","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 et al (2017) Improved branch-cut-and-price for capacitated vehicle routing. Math Program Comput 9:61\u2013100","journal-title":"Math Program Comput"},{"issue":"2","key":"585_CR50","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 et al (2018) Automation and combination of linear-programming based stabilization techniques in column generation. INFORMS J Comput 30(2):339\u2013360. https:\/\/doi.org\/10.1287\/ijoc.2017.0784","journal-title":"INFORMS J Comput"},{"issue":"1\u20132","key":"585_CR51","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10107-020-01523-z","volume":"183","author":"A Pessoa","year":"2020","unstructured":"Pessoa A, Sadykov R, Uchoa E et al (2020) A generic exact solver for vehicle routing and related problems. Math Program 183(1\u20132):483\u2013523. https:\/\/doi.org\/10.1007\/s10107-020-01523-z","journal-title":"Math Program"},{"key":"585_CR52","unstructured":"Petris M (2023) Branch-price-and-cut algorithms for integrated optimisation problems in transportation and healthcare. Ph.D. thesis, Centrale Lille, available at https:\/\/www.theses.fr\/s305103"},{"issue":"4","key":"585_CR53","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1002\/net.22238","volume":"84","author":"M Petris","year":"2024","unstructured":"Petris M, Archetti C, Cattaruzza D et al (2024) A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem. Networks 84(4):446\u2013464","journal-title":"Networks"},{"key":"585_CR54","volume-title":"Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro CC, Hansen P, Desaulniers G et al (2002) Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. Springer, Berlin"},{"issue":"3","key":"585_CR55","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim 3(3):255\u2013273. https:\/\/doi.org\/10.1016\/j.disopt.2006.05.007","journal-title":"Discrete Optim"},{"issue":"3","key":"585_CR56","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G Righini","year":"2008","unstructured":"Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155\u2013170. https:\/\/doi.org\/10.1002\/net.20212","journal-title":"Networks"},{"issue":"3","key":"585_CR57","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 (2014) Dynamic ng-path relaxation for the delivery man problem. Transp Sci 48(3):413\u2013424","journal-title":"Transp Sci"},{"key":"585_CR58","unstructured":"R\u00f8pke S (2012) Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. Presentation in Column Generation 2012"},{"key":"585_CR59","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/B:ANOR.0000032576.73681.29","volume":"130","author":"LM Rousseau","year":"2004","unstructured":"Rousseau LM, Gendreau M, Pesant G et al (2004) Solving VRPTWs with constraint programming based column generation. Ann Oper Res 130:199\u2013216","journal-title":"Ann Oper Res"},{"key":"585_CR60","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":"585_CR61","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 et al (2019) Primal heuristics for branch and price: the assets of diving methods. INFORMS J Comput 31(2):251\u2013267. https:\/\/doi.org\/10.1287\/ijoc.2018.0822","journal-title":"INFORMS J Comput"},{"issue":"1","key":"585_CR62","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/trsc.2020.0985","volume":"55","author":"R Sadykov","year":"2021","unstructured":"Sadykov R, Uchoa E, Pessoa A (2021) A bucket graph-based labeling algorithm with application to vehicle routing. Transp Sci 55(1):4\u201328","journal-title":"Transp Sci"},{"key":"585_CR63","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver A (1998) Theory of linear and integer programming. Wiley, New York"},{"issue":"2","key":"585_CR64","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.ejor.2017.03.017","volume":"261","author":"C Tilk","year":"2017","unstructured":"Tilk C, Rothenb\u00e4cher AK, Gschwind T et al (2017) Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. Eur J Oper Res 261(2):530\u2013539","journal-title":"Eur J Oper Res"},{"issue":"4","key":"585_CR65","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth P, Vigo D (2003) The granular tabu search and its application to the vehicle-routing problem. INFORMS J Comput 15(4):333\u2013346. https:\/\/doi.org\/10.1287\/ijoc.15.4.333.24890","journal-title":"INFORMS J Comput"},{"key":"585_CR66","doi-asserted-by":"crossref","DOI":"10.1002\/9781119606475","volume-title":"Integer programming","author":"LA Wolsey","year":"2020","unstructured":"Wolsey LA (2020) Integer programming. Wiley, New York"},{"key":"585_CR67","volume-title":"Integer and combinatorial optimization","author":"LA Wolsey","year":"1999","unstructured":"Wolsey LA, Nemhauser GL (1999) Integer and combinatorial optimization, vol 55. Wiley, New York"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00585-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-025-00585-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00585-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:45:50Z","timestamp":1743381950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-025-00585-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":67,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["585"],"URL":"https:\/\/doi.org\/10.1007\/s10288-025-00585-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"17 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}