I. Stupia, L. Vandendorpe, L. Sanguinetti, and G. Bacci, Distributed energy-efficient power optimization for relay-aided heterogeneous networks, 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01098833

M. Lauer, External Libraries, Introducing Vala Programming, pp.211-234, 2019.

T. Achterberg, Conflict analysis in mixed integer programming, Discrete Optimization, vol.4, issue.1, pp.4-20, 2007.

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

C. Archetti, D. Feillet, A. Hertz, and M. G. Speranza, The capacitated team orienteering and profitable tour problems, Journal of the Operational Research Society, vol.60, issue.6, pp.831-842, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01299943

P. Avella, M. Boccia, and I. Vasilyev, A computational study of exact knapsack separation for the generalized assignment problem, Computational Optimization and Applications, vol.45, issue.3, pp.543-555, 2008.

R. Baldacci, E. Bartolini, and A. Mingozzi, An Exact Algorithm for the Pickup and Delivery Problem with Time Windows, Operations Research, vol.59, issue.2, pp.414-426, 2011.

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

M. L. Balinski and R. E. Quandt, On an Integer Program for a Delivery Problem, Operations Research, vol.12, issue.2, pp.300-304, 1964.

E. Bartolini, J. Cordeau, and G. Laporte, Improved lower bounds and exact algorithm for the capacitated arc routing problem, Mathematical Programming, vol.137, issue.1-2, pp.409-452, 2011.

J. E. Beasley, OR-Library: Distributing Test Problems by Electronic Mail, Journal of the Operational Research Society, vol.41, issue.11, pp.1069-1072, 1990.

J. M. Belenguer and E. Benavent, The capacitated arc routing problem: Valid inequalities and facets, Computational Optimization and Applications, vol.10, issue.2, pp.165-187, 1998.

G. Belov and G. Scheithauer, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, European Journal of Operational Research, vol.171, issue.1, pp.85-106, 2006.

E. Benavent, Á. Corberán, G. Desaulniers, F. Lessard, I. Plana et al., A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem, Networks, vol.63, issue.1, pp.34-45, 2013.

N. Bianchessi, R. Mansini, and M. G. Speranza, A branch?and?cut algorithm for the Team Orienteering Problem, International Transactions in Operational Research, vol.25, issue.2, pp.627-635, 2017.

C. Bode and S. Irnich, Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem, Operations Research, vol.60, issue.5, pp.1167-1182, 2012.

F. Brandão and J. P. Pedroso, Bin packing and related problems: General arc-flow formulation with graph compression, Computers & Operations Research, vol.69, pp.56-67, 2016.

T. Bulhões, 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.

T. Bulhões, A. Pessoa, F. Protti, and E. Uchoa, On the complete set packing and set partitioning polytopes: Properties and rank 1 facets, Operations Research Letters, vol.46, issue.4, pp.389-392, 2018.

T. Bulhões, R. Sadykov, and E. Uchoa, A branch-and-price algorithm for the Minimum Latency Problem, Computers & Operations Research, vol.93, pp.66-78, 2018.

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.

I. Chao, B. L. Golden, and E. A. Wasil, The team orienteering problem, European Journal of Operational Research, vol.88, issue.3, pp.464-474, 1996.

N. Christofides and S. Eilon, An Algorithm for the Vehicle-dispatching Problem, Journal of the Operational Research Society, vol.20, issue.3, pp.309-318, 1969.

N. Christofides, A. Mingozzi, and P. Toth, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Mathematical Programming, vol.20, issue.1, pp.255-282, 1981.

F. Clautiaux, S. Hanafi, R. Macedo, M. Voge, and C. Alves, Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints, European Journal of Operational Research, vol.258, issue.2, pp.467-477, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01410170

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.

J. Cordeau, M. Gendreau, and G. Laporte, A tabu search heuristic for periodic and multi-depot vehicle routing problems, Networks, vol.30, issue.2, pp.105-119, 1997.

G. B. Dantzig and J. H. Ramser, The Truck Dispatching Problem, Management Science, vol.6, issue.1, pp.80-91, 1959.

M. Delorme and M. Iori, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, INFORMS Journal on Computing, vol.32, issue.1, pp.101-119, 2020.

M. Delorme, M. Iori, and S. Martello, Bin packing and cutting stock problems: Mathematical models and exact algorithms, European Journal of Operational Research, vol.255, issue.1, pp.1-20, 2016.

G. Desaulniers, J. Desrosiers, I. Loachim, M. M. Solomon, F. Soumis et al., A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems, Fleet Management and Logistics, pp.57-93, 1998.

. Springer, Strafprozessrecht, 1998.

G. Desaulniers, F. Lessard, and A. Hadjar, Tabu Search, Partial Elementarity, and Generalizedk-Path Inequalities for the Vehicle Routing Problem with Time Windows, Transportation Science, vol.42, issue.3, pp.387-404, 2008.

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

R. W. Eglese and L. Y. Li, Efficient Routeing for Winter Gritting, Journal of the Operational Research Society, vol.43, issue.11, pp.1031-1034, 1992.

R. El-hajj, D. Dang, and A. Moukrim, Solving the team orienteering problem with cutting planes, Computers & Operations Research, vol.74, pp.21-30, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01300334

E. Falkenauer, A hybrid grouping genetic algorithm for bin packing, Journal of Heuristics, vol.2, issue.1, pp.5-30, 1996.

R. Fukasawa, H. Longo, J. Lysgaard, M. P. Aragão, M. Reis et al., Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem, Mathematical Programming, vol.106, issue.3, pp.491-511, 2005.

H. Gehring and J. Homberger, Parallelization of a two-phase metaheuristic for routing problems with time windows, Journal of Heuristics, vol.8, issue.3, pp.251-276, 2002.

S. Gélinas, M. Desrochers, J. Desrosiers, and M. M. Solomon, A new branching strategy for time constrained routing problems with application to backhauling, Annals of Operations Research, vol.61, issue.1, pp.91-109, 1995.

L. Gouveia, M. Leitner, and M. Ruthmair, Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem, European Journal of Operational Research, vol.262, issue.3, pp.908-928, 2017.

T. Gschwind, S. Irnich, A. Rothenbächer, and C. Tilk, Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems, European Journal of Operational Research, vol.266, issue.2, pp.521-530, 2018.

. Llc-gurobi-optimization, Gurobi announces Gurobi Optimizer 3.0, 2019.

S. Held, W. Cook, and E. C. Sewell, Maximum-weight stable sets and safe lower bounds for graph coloring, Mathematical Programming Computation, vol.4, issue.4, pp.363-381, 2012.

K. Heßler, T. Gschwind, and S. Irnich, Stabilized branch-and-price algorithms for vector packing problems, European Journal of Operational Research, vol.271, issue.2, pp.401-419, 2018.

S. Irnich, Resource extension functions: properties, inversion, and generalization to segments, OR Spectrum, vol.30, issue.1, pp.113-148, 2007.

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.

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.

B. Kallehauge, J. Larsen, and O. B. Madsen, Lagrangian duality applied to the vehicle routing problem with time windows, Computers & Operations Research, vol.33, issue.5, pp.1464-1487, 2006.

. O-kullmann, Handbook of Satisfiability, chapter Fundaments of branching heuristics, pp.205-244, 2009.

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.

P. L. Bodic and G. Nemhauser, An abstract model for branching and its application to mixed integer programming, Mathematical Programming, vol.166, issue.1, pp.369-405, 2017.

H. Li and A. Lim, A Metaheuristic for the Pickup and Delivery Problem with Time Windows, International Journal on Artificial Intelligence Tools, vol.12, issue.02, pp.173-186, 2003.

H. Longo, M. P. De-aragão, and E. Uchoa, Solving capacitated arc routing problems using a transformation to the CVRP, Computers & Operations Research, vol.33, issue.6, pp.1823-1837, 2006.

J. Lysgaard, CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Aarhus School of Business, 2003.

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.

G. Marques, R. Sadykov, J. Deschamps, and R. Dupas, An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, Computers & Operations Research, vol.114, p.104833, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02112287

R. M. Nauss, Solving the generalized assignment problem: An optimizing and heuristic approach, INFORMS Journal on Computing, vol.15, issue.3, pp.249-266, 2003.

A. Parmentier, Algorithms for non-linear and stochastic resource constrained shortest path, Mathematical Methods of Operations Research, vol.89, issue.2, pp.281-317, 2018.

D. Pecin, A. Pessoa, M. Poggi, and E. Uchoa, Improved Branch-Cut-and-Price for Capacitated Vehicle Routing, Integer Programming and Combinatorial Optimization, vol.8494, pp.393-403, 2014.

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-andprice 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, Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm, Transportation Science, vol.53, issue.6, pp.1501-1799, 2019.

A. Pessoa and M. Poss, Ruslan Sadykov, and François Vanderbeck. Branch-and-cutand-price for the robust capacitated vehicle routing problem with knapsack uncertainty, Operations Research, p.2020

A. 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.
URL : https://hal.archives-ouvertes.fr/hal-01664844

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

B. Petersen, D. Pisinger, and S. Spoorendonk, Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, Operations Research/Computer Science Interfaces, pp.397-419

M. Poggi-de-aragão and E. Uchoa, Integer program reformulation for robust branch-andcut-and-price, Annals of Mathematical Programming in Rio, pp.56-61, 2003.

M. Posta, J. A. Ferland, and P. Michelon, An exact method with variable fixing for solving the generalized assignment problem, Computational Optimization and Applications, vol.52, pp.629-644, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01320026

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.

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

S. Ropke and J. Cordeau, Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows, Transportation Science, vol.43, issue.3, pp.267-286, 2009.

D. M. Ryan and B. A. Foster, An integer programming approach to scheduling, Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling, pp.269-280, 1981.

R. Sadykov, E. Uchoa, and A. Pessoa, A Bucket Graph?Based Labeling Algorithm with Application to Vehicle Routing, Transportation Science, p.2020, 2020.

R. Sadykov, F. Vanderbeck, A. Pessoa, I. Tahiri, and E. Uchoa, Primal Heuristics for Branch and Price: The Assets of Diving Methods, INFORMS Journal on Computing, vol.31, issue.2, pp.251-267, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01237204

J. E. Schoenfield, us army army missile command sinosoviet bloc missile and space technology june 1965 top secret dinar ruff

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.

E. Uchoa, D. Pecin, A. Pessoa, M. Poggi, T. Vidal et al., New benchmark instances for the Capacitated Vehicle Routing Problem, European Journal of Operational Research, vol.257, issue.3, pp.845-858, 2017.

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

F. Vanderbeck and L. A. Wolsey, Reformulation and Decomposition of Integer Programs, 50 Years of Integer Programming 1958-2008, pp.431-502, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00392254

L. Wei, Z. Luo, R. Baldacci, and A. Lim, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, INFORMS Journal on Computing, vol.32, issue.2, pp.428-443, 2020.