C. Archetti, N. Bianchessi, and M. Speranza, Optimal solutions for routing problems with profits, Discrete Applied Mathematics, vol.161, issue.4-5, pp.547-557, 2013.

R. Baldacci, E. Bartolini, and A. Mingozzi, , 2011.

, An exact algorithm for the pickup and delivery problem with time windows, Operations Research, vol.59, issue.2, pp.414-426

R. Baldacci, N. Christofides, and A. Mingozzi, , 2008.

, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, vol.115, pp.351-385

R. Baldacci and A. Mingozzi, , 2009.

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

. References, R. Baldacci, A. Mingozzi, and R. Roberti, , 2011.

, New route relaxation and pricing strategies for the vehicle routing problem, Operations Research, vol.59, issue.5, pp.1269-1283

M. Balinski and R. Quandt, On an integer program for a delivery problem, Operations Research, vol.12, issue.2, pp.300-304, 1964.

N. Bianchessi, R. Mansini, and M. G. Speranza, , 2018.

, A branch-and-cut algorithm for the team orienteering problem, International Transactions in Operational Research, vol.25, issue.2, pp.627-635

F. Brandão and . Pedroso, J. a. P, 2016.

, Bin packing and related problems: General arc-flow formulation with graph compression

, Computers & Operations Research, vol.69, pp.56-67

. References, T. Bulhoes, M. H. Hà, R. Martinelli, and T. Vidal, The vehicle routing problem with service level constraints, European Journal of Operational Research, vol.265, issue.2, pp.544-558, 2018.

N. Christofides, A. Mingozzi, and P. Toth, , 1981.

, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Mathematical Programming, vol.20, issue.1, pp.255-282

C. Contardo and R. Martinelli, , 2014.

, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, Discrete Optimization, vol.12, pp.129-146

L. Costa, C. Contardo, and G. Desaulniers, Exact branch-price-and-cut algorithms for vehicle routing, Transportation Science, Forthcoming. References IV Dantzig, vol.6, issue.1, pp.80-91, 1959.

M. Delorme and M. Iori, , 2018.

, Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems, INFORMS Journal on Computing

G. Desaulniers, J. Desrosiers, I. Loachim, M. M. Solomon, F. Soumis et al., , 1998.

, A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems, pp.57-93

M. Desrochers, J. Desrosiers, and M. Solomon, , 1992.

, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, vol.40, issue.2, pp.342-354

D. References-v-feillet, P. Dejax, M. Gendreau, and C. Gueguen, , 2004.

, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks, vol.44, issue.3, pp.216-229

R. Fukasawa, H. Longo, J. Lysgaard, M. P. Aragão, M. Reis et al., , 2006.

, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Mathematical Programming, vol.106, issue.3, pp.491-511

T. Gschwind, S. Irnich, A. Rothenbächer, and C. Tilk, Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems, 2018.

, European Journal of Operational Research, vol.266, issue.2, pp.521-530

L. Gurobi-optimization, , 2017.

K. Gschwind, T. Irnich, and S. , Gurobi optimizer reference manual, version 7.5. References VI Heßler, 2018.

, Stabilized branch-and-price algorithms for vector packing problems, European Journal of Operational Research, vol.271, issue.2, pp.401-419

S. Irnich, G. Desaulniers, J. Desrosiers, and A. Hadjar, , 2010.

, Path-reduced costs for eliminating arcs in routing and scheduling, INFORMS Journal on Computing, vol.22, issue.2, pp.297-313

S. Irnich and D. Villeneuve, The shortest-path problem with resource constraints and k-cycle elimination for k ? 3, INFORMS Journal on Computing, vol.18, issue.3, pp.391-406, 2006.

M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger, , 2008.

, Subset-row inequalities applied to the vehicle-routing problem with time windows, Operations Research, vol.56, issue.2, pp.497-511

, References VII

G. Laporte and Y. Nobert, , 1983.

, A branch and bound algorithm for the capacitated vehicle routing problem, Operations-Research-Spektrum, vol.5, issue.2, pp.77-85

L. Lozano, D. Duque, and A. L. Medaglia, , 2016.

, An exact algorithm for the elementary shortest path problem with resource constraints, Transportation Science, vol.50, issue.1, pp.348-357

J. Lysgaard, A. N. Letchford, and R. W. Eglese, , 2004.

, A new branch-and-cut algorithm for the capacitated vehicle routing problem, Mathematical Programming, vol.100, issue.2, pp.423-445

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. References-viii-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.

D. Pecin and E. Uchoa, , 2019.

, Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm, Transportation Science

A. Pessoa, . De-aragão, M. P. 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. References-ix-pessoa, R. Sadykov, and E. Uchoa, Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems, European Journal of Operational Research, vol.270, pp.530-543, 2018.

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, A generic exact solver for vehicle routing and related problems, Integer Programming and Combinatorial Optimization, vol.11480, pp.354-369, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02178171

M. Poggi and E. Uchoa, , 2014.

, New Exact Algorithms for the Capacitated Vehicle Routing Problem, pp.59-86

M. References-x-posta, J. A. Ferland, and P. Michelon, , 2012.

, An exact method with variable fixing for solving the generalized assignment problem, Computational Optimization and Applications, vol.52, pp.629-644

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, , 2014.

, Dynamic ng-path relaxation for the delivery man problem, Transportation Science, vol.48, issue.3, pp.413-424

S. Røpke, , 2012.

, Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. Presentation in Column Generation, 2012.

X. S. References, R. Uchoa, E. Pessoa, and A. , , 2017.

, A bucket graph based labeling algorithm with application to vehicle routing. Cadernos do LOGIS 7

C. Tilk, A. 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.

E. Uchoa, D. Pecin, A. Pessoa, M. Poggi, A. Subramanian et al., , 2017.

, New benchmark instances for the capacitated vehicle routing problem, European Journal of Operational Research, vol.257, issue.3, pp.845-858

L. Wei, Z. Luo, R. Baldacci, and A. Lim, , 2019.

, A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems, INFORMS Journal on Computing