Y. Amarouche, R. N. Guibadj, E. Chaalal, and A. Moukrim, Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows, Computers & Operations Research, vol.123, issue.15, p.105039, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02890475

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

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, issue.2, pp.351-385, 2007.

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.

R. Baldacci, A. Mingozzi, R. Roberti, and R. W. Calvo, An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem, Operations Research, vol.61, issue.2, pp.298-314, 2013.

J. M. Belenguer, M. C. Martinez, and E. Mota, A Lower Bound for the Split Delivery Vehicle Routing Problem, Operations Research, vol.48, issue.5, pp.801-810, 2000.

J. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Wolfler-calvo, A Branch-and-Cut method for the Capacitated Location-Routing Problem, Computers & Operations Research, vol.38, issue.6, pp.931-941, 2011.
URL : https://hal.archives-ouvertes.fr/hal-02474696

U. Breunig, V. Schmid, R. F. Hartl, and T. Vidal, A large neighbourhood based heuristic for two-echelon routing problems, Computers & Operations Research, vol.76, pp.208-225, 2016.

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

C. Contardo, V. Hemmelmayr, and T. G. Crainic, Lower and upper bounds for the two-echelon capacitated location-routing problem, Computers & Operations Research, vol.39, issue.12, pp.3185-3199, 2012.

C. Contardo, J. Cordeau, and B. Gendron, A computational comparison of flow formulations for the capacitated location-routing problem, Discrete Optimization, vol.10, issue.4, pp.263-295, 2013.

T. Gabriel-crainic, N. Ricciardi, and G. Storchi, Models for evaluating and planning city logistics systems, Transportation science, vol.43, issue.4, pp.432-454, 2009.

T. Gabriel-crainic, G. Perboli, S. Mancini, and R. Tadei, Two-echelon vehicle routing problem: A satellite location analysis, Procedia -Social and Behavioral Sciences, vol.2, issue.3, pp.5944-5955, 2010.

T. Gabriel-crainic, A. Sforza, and C. Sterle, Location-routing models for twoechelon freight distribution system design, 2011.

R. Cuda, G. Guastaroba, and M. G. Speranza, A survey on two-echelon routing problems, Computers & Operations Research, vol.55, pp.185-199, 2015.

N. Dellaert, F. Dashty-saridarq, T. G. Van-woensel, and T. G. Crainic, Branch-and-Price?Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows, Transportation Science, vol.53, issue.2, pp.463-479, 2019.

I. Dunning, J. Huchette, and M. Lubin, JuMP: A Modeling Language for Mathematical Optimization, SIAM Review, vol.59, issue.2, pp.295-320, 2017.

J. Gonzalez-feliu, G. Perboli, R. Tadei, and D. Vigo, The two-echelon capacitated vehicle routing problem, 2007.
URL : https://hal.archives-ouvertes.fr/halshs-00879447

C. Vera, J. Hemmelmayr, T. G. Cordeau, and . Crainic, An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics, Computers & Operations Research, vol.39, issue.12, pp.3215-3228, 2012.

M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger, Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows, Operations Research, vol.56, issue.2, pp.497-511, 2008.

M. Jepsen, S. Spoorendonk, and S. Ropke, A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem, Transportation Science, vol.47, issue.1, pp.23-37, 2013.

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

N. Adam, J. Letchford, and . Salazar-gonzález, Projection results for vehicle routing, Mathematical Programming, vol.105, issue.2, pp.251-274, 2006.

J. Lysgaard, The pyramidal capacitated vehicle routing problem, European Journal of Operational Research, vol.205, issue.1, pp.59-64, 2010.

J. Lysgaard, A. N. Letchford, and R. W. Eglese, A new branch-and-cut algorithm for the capacitated vehicle routing problem, Mathematical Programming, vol.100, issue.2, pp.423-445, 2004.

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

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.

G. Perboli, R. Tadei, and D. Vigo, The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics, Transportation Science, vol.45, issue.3, pp.364-380, 2011.

A. Pessoa, M. P. De-aragão, and E. Uchoa, Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems, Operations Research/Computer Science Interfaces, vol.43, pp.297-325