C. Alves and J. M. Valério-de-carvalho, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Computers & Operations Research, vol.35, issue.4, pp.1315-1328, 2008.

C. F. Adriana, . Alvim, C. Celso, F. Ribeiro, D. J. Glover et al., A hybrid improvement heuristic for the one-dimensional bin packing problem, Journal of Heuristics, vol.10, issue.2, pp.205-229, 2004.

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.

M. Mauro, T. G. Baldi, G. Crainic, R. Perboli, and . Tadei, Branchand-price and beam search algorithms for the variable cost and size bin packing problem with optional items, Annals of Operations Research, vol.222, issue.1, pp.125-141, 2014.

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.

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.

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.

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.

L. Costa, C. Contardo, and G. Desaulniers, Exact Branch-Price-and-Cut Algorithms for Vehicle Routing, Transportation Science, vol.53, issue.4, pp.946-985, 2019.

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.

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

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

P. Sándor, J. Fekete, and . Schepers, New classes of fast lower bounds for bin packing problems. Mathematical programming, vol.91, pp.11-31, 2001.

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.

C. Paul, R. E. Gilmore, and . Gomory, A linear programming approach to the cutting-stock problem, Operations research, vol.9, issue.6, pp.849-859, 1961.

M. Haouari and M. Serairi, Relaxations and exact solution of the variable sized bin packing problem, Computational Optimization and Applications, vol.48, issue.2, pp.345-368, 2009.

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. Hessler, 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 and G. Desaulniers, Shortest Path Problems with Resource Constraints, Column Generation, pp.33-65

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.

V. Leonid and . Kantorovich, Mathematical methods of organizing and planning production, Management science, vol.6, issue.4, pp.366-422, 1960.

M. Monaci, Algorithms for packing and scheduling problems, Quarterly Journal of the Belgian, French and Italian Operations Research Societies, vol.1, issue.1, 2003.

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

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, issue.2, 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, Mathematical Programming, vol.183, issue.1-2, pp.483-523, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02178171

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, A Generic Exact Solver for Vehicle Routing and Related Problems, Integer Programming and Combinatorial Optimization, pp.354-369, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02178171

U. Pferschy, D. Kellerer, and . Pisinger, Knapsack problems, 2004.

D. Pisinger, A Minimal Algorithm for the 0-1 Knapsack Problem, Operations Research, vol.45, issue.5, pp.758-767, 1997.

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

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. José and . Valério-de-carvalho, Using extra dual cuts to accelerate column generation, IN-FORMS Journal on Computing, vol.17, issue.2, pp.175-182, 2005.

H. Pamela, C. Vance, . Barnhart, L. Ellis, G. L. Johnson et al., Solving binary cutting stock problems by column generation and branch-and-bound, Computational optimization and applications, vol.3, issue.2, pp.111-130, 1994.

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

G. W?scher and T. Gau, Heuristics for the integer one-dimensional cutting stock problem: A computational study, OR Spektrum, vol.18, issue.3, pp.131-144, 1996.

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.

L. Wei, M. Lai, A. Lim, and Q. Hu, A branch-and-price algorithm for the two-dimensional vector packing problem, European Journal of Operational Research, vol.281, issue.1, pp.25-35, 2020.