Y. Nagata and O. Bräysy, Edge assembly-based memetic algorithm for the capacitated vehicle routing problem, Networks, vol.54, issue.4, pp.205-215, 2009.

D. Pecin, C. Contardo, G. Desaulniers, and E. Uchoa, New enhancements for the exact solution of the vehicle routing problem with time windows, INFORMS Journal on Computing, vol.29, issue.3, pp.489-502, 2017.

D. Pecin, A. Pessoa, M. Poggi, and E. Uchoa, Improved branch-cut-and-price for capacitated vehicle routing, Integer Programming and Combinatorial Optimization, pp.393-403, 2014.

D. Pecin, A. Pessoa, M. Poggi, and E. Uchoa, Improved branch-cut-and-price for capacitated vehicle routing, Mathematical Programming Computation, vol.9, issue.1, pp.61-100, 2017.

D. Pecin, A. Pessoa, M. Poggi, E. Uchoa, and H. Santos, Limited memory rank-1 cuts for vehicle routing problems, Operations Research Letters, vol.45, issue.3, pp.206-209, 2017.

P. Penna, A. Subramanian, L. S. Ochi, T. Vidal, and C. Prins, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, Annals of Operations Research, vol.273, issue.1, pp.5-74, 2019.

A. Pessoa, M. P. De-aragão, . Marcus, and E. Uchoa, Robust branch-cut-and-price algorithms for vehicle routing problems, The Vehicle Routing Problem: Latest Advances and New Challenges, vol.43, pp.297-325, 2008.

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, Automation and combination of linear-programming based stabilization techniques in column generation, INFORMS Journal on Computing, vol.30, issue.2, pp.339-360, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01077984

A. Pessoa, E. Uchoa, M. P. De-aragão, and R. Rodrigues, Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems, Mathematical Programming Computation, vol.2, issue.3, pp.259-290, 2010.

M. Poggi and E. Uchoa, New exact algorithms for the capacitated vehicle routing problem. Vehicle Routing: Problems, pp.59-86, 2014.

L. Pugliese and F. Guerriero, A survey of resource constrained shortest path problems: Exact solution approaches, Networks, vol.62, issue.3, pp.183-200, 2013.

G. Righini and M. Salani, Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optimization, vol.3, issue.3, pp.255-273, 2006.

R. Roberti and A. Mingozzi, Dynamic ng-path relaxation for the delivery man problem, Transportation Science, vol.48, issue.3, pp.413-424, 2014.

M. M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, vol.35, issue.2, pp.254-265, 1987.

C. Tilk, A. K. Rothenbächer, T. Gschwind, and S. Irnich, Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster, European Journal of Operational Research, vol.261, issue.2, pp.530-539, 2017.

F. Vanderbeck, R. Sadykov, and I. Tahiri, BaPCod -a generic Branch-And-Price Code, 2017.

T. Vidal, T. G. Crainic, M. Gendreau, N. Lahrichi, and W. Rei, A hybrid genetic algorithm for multidepot and periodic vehicle routing problems, Operations Research, vol.60, issue.3, pp.611-624, 2012.

T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Computers and Operations Research, vol.40, issue.1, pp.475-489, 2013.
URL : https://hal.archives-ouvertes.fr/hal-02476430