H. Aissi, C. Bazgan, and D. Vanderpooten, Min-max and min-max regret versions of combinatorial optimization problems: A survey, European Journal of Operational Research, vol.197, issue.2, pp.427-438, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00158652

E. Alvarez-miranda, I. Ljubic, and P. Toth, A note on the bertsimas & sim algorithm for robust combinatorial optimization problems, 4OR, vol.11, issue.4, pp.349-360, 2013.

R. Baldacci, N. Christofides, and A. Mingozzi, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, vol.115, pp.351-385, 2008.

R. Baldacci and A. Mingozzi, A unified exact method for solving different classes of vehicle routing problems, Mathematical Programming, vol.120, issue.2, pp.347-380, 2009.

R. Baldacci, A. Mingozzi, and R. Roberti, New route relaxation and pricing strategies for the vehicle routing problem, Operations Research, vol.59, issue.5, pp.1269-1283, 2011.

A. Ben-tal, E. Ghaoui, L. Nemirovski, and A. , , 2009.

A. Ben-tal, A. P. Goryashko, E. Guslitzer, and A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Mathematical Programming, vol.99, issue.2, pp.351-376, 2004.

A. Ben-tal and A. Nemirovski, Robust convex optimization, Mathematics of Operations Research, vol.23, issue.4, pp.769-805, 1998.

D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Mathematical Programming, vol.98, issue.1-3, pp.49-71, 2003.

D. Bertsimas and M. Sim, The price of robustness, Operations Research, vol.52, issue.1, pp.35-53, 2004.

J. R. Birge and F. V. Louveaux, Introduction to Stochastic programming, 2011.

T. Bulhoes, R. Sadykov, and E. Uchoa, A branch-and-price algorithm for the minimum latency problem, Computers & Operations Research, vol.93, pp.66-78, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01664835

A. Caprara and P. Toth, Lower bounds and algorithms for the 2-dimensional vector packing problem, Discrete Applied Mathematics, vol.111, issue.3, pp.231-262, 2001.

T. Dinh, R. Fukasawa, and J. Luedtke, Exact algorithms for the chance-constrained vehicle routing problem, Mathematical Programming, vol.172, issue.1, pp.105-138, 2018.

R. Fukasawa, H. Longo, J. Lysgaard, A. Mpd, M. Reis et al., Robust branch-andcut-and-price for the capacitated vehicle routing problem, Mathematical Programming, vol.106, issue.3, pp.491-511, 2006.

M. Gendreau, G. Laporte, and R. Séguin, Stochastic vehicle routing, European Journal of Operational Research, vol.88, issue.1, pp.3-12, 1996.

S. Ghosal and W. Wiesemann, The distributionally robust chance constrained vehicle routing problem, 2019.

C. E. Gounaris, P. P. Repoussis, C. D. Tarantilis, W. Wiesemann, and C. A. Floudas, An adaptive memory programming framework for the robust capacitated vehicle routing problem, Tranportaion Science, vol.50, issue.4, pp.1239-1260, 2016.

C. E. Gounaris, W. Wiesemann, and C. A. Floudas, The robust capacitated vehicle routing problem under demand uncertainty, Operations Research, vol.61, issue.3, pp.677-693, 2013.

K. Høyland, M. Kaut, and S. W. Wallace, A heuristic for moment-matching scenario generation, Computational Optimization and Applications, vol.24, issue.2, pp.169-185, 2003.

S. Irnich and G. Desaulniers, Shortest Path Problems with Resource Constraints, pp.33-65, 2005.

S. Irnich, G. Desaulniers, J. Desrosiers, and A. Hadjar, Path-reduced costs for eliminating arcs in routing and scheduling, INFORMS Journal on Computing, vol.22, issue.2, pp.297-313, 2010.

. Pessoa, Branch-cut-and-price for vehicle routing problem with demand uncertainty ec22 e-companion to Pessoa et al.: Branch-cut-and-price for vehicle routing problem with demand uncertainty ec24 e-companion to Pessoa et al.: Branch-cut-and-price for vehicle routing problem with demand uncertainty

, B-n66-k9 1249, vol.2, pp.1251-1298

, A-n33-k5 630.7 642 2.65 B-n67-k10 1006, vol.0, p.1007

, B-n68-k9 1204, vol.1, pp.1205-1229

, A-n34-k5 708.8 715 0.60 B-n78-k10 1130, vol.3, p.1131

, A-n54-k7 1105.5 1106 7.70 F-n45-k4

, A-n60-k9 1276.2 1280 4.65 F-n135-k7 1111, vol.8, p.1122

, A-n61-k9 978.4 983 5.28 M-n101-k10

. Inst, UB avg t. min t. max t. Inst. UB avg t

, A-n60-k9 1404.1 1408 176.50 F-n45-k4

, A-n63-k10 1348.0 1348 56.41 P-n19-k2