H. B. Amor, J. Desrosiers, and J. M. De-carvalho, Dual-Optimal Inequalities for Stabilized Column Generation, Operations Research, vol.54, issue.3, pp.454-463, 2006.
DOI : 10.1287/opre.1060.0278

H. , B. Amor, and J. M. De-carvalho, Cutting stock problems, Column Generation, pp.131-161, 2005.

P. Benchimol, G. Desaulniers, and J. Desrosiers, Stabilized dynamic constraint aggregation for solving set partitioning problems, European Journal of Operational Research, vol.223, issue.2, 2012.
DOI : 10.1016/j.ejor.2012.07.004

O. Briant, C. Lemarchal, P. Meurdesoif, S. Michel, N. Perrot et al., Comparison of bundle and classical column generation, Mathematical Programming, pp.299-344, 2008.
DOI : 10.1007/s10107-006-0079-z

URL : https://hal.archives-ouvertes.fr/inria-00342510

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.
DOI : 10.1016/S0166-218X(00)00267-5

J. Carvalho, Using Extra Dual Cuts to Accelerate Column Generation, INFORMS Journal on Computing, vol.17, issue.2, pp.175-182, 2005.
DOI : 10.1287/ijoc.1030.0060

F. Clautiaux, C. Alves, and J. Carvalho, A survey of dual-feasible and superadditive functions, Annals of Operations Research, vol.183, issue.6, pp.317-342, 2009.
DOI : 10.1007/s10479-008-0453-8

URL : https://hal.archives-ouvertes.fr/inria-00522674

F. Clautiaux, C. Alves, J. M. De-carvalho, and J. Rietz, New Stabilization Procedures for the Cutting Stock Problem, INFORMS Journal on Computing, vol.23, issue.4, pp.530-545, 2011.
DOI : 10.1287/ijoc.1100.0415

O. Du-merle, D. Villeneuve, J. Desrosiers, and P. Hansen, Stabilized column generation, Discrete Mathematics, vol.194, issue.1-3, pp.229-237, 1999.
DOI : 10.1016/S0012-365X(98)00213-1

I. Elhallaoui, A. Metrane, F. Soumis, and G. Desaulniers, Multi-phase dynamic constraint aggregation for set partitioning type problems, Mathematical Programming, pp.345-370, 2010.
DOI : 10.1007/s10107-008-0254-5

I. Elhallaoui, D. Villeneuve, F. Soumis, and G. Desaulniers, Dynamic Aggregation of Set-Partitioning Constraints in Column Generation, Operations Research, vol.53, issue.4, pp.632-645, 2005.
DOI : 10.1287/opre.1050.0222

M. Gendreau, G. Laporte, and F. Semet, Heuristics and lower bounds for the bin packing problem with conflicts, Computers & Operations Research, vol.31, issue.3, pp.347-358, 2004.
DOI : 10.1016/S0305-0548(02)00195-8

P. Gilmore and R. Gomory, A Linear Programming Approach to the Cutting-Stock Problem, Operations Research, vol.9, issue.6, pp.849-859, 1961.
DOI : 10.1287/opre.9.6.849

P. Gilmore and R. Gomory, A Linear Programming Approach to the Cutting Stock Problem???Part II, Operations Research, vol.11, issue.6, pp.863-888, 1963.
DOI : 10.1287/opre.11.6.863

L. Kantorovich, Mathematical Methods of Organizing and Planning Production, Management Science, vol.6, issue.4, pp.363-422, 1960.
DOI : 10.1287/mnsc.6.4.366

I. Litvinchev and V. Tsurkov, Aggregation in large-scale optimization, 2003.
DOI : 10.1007/978-1-4419-9154-6

M. Luebbecke and J. Desrosiers, Selected Topics in Column Generation, Operations Research, vol.53, issue.6, pp.1007-1023, 2005.
DOI : 10.1287/opre.1050.0234

G. S. Lueker, Bin packing with items uniformly distributed over intervals [a,b], 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp.289-297, 1983.
DOI : 10.1109/SFCS.1983.9

R. Macedo, C. Alves, J. M. De-carvalho, F. Clautiaux, and S. Hanafi, Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model, European Journal of Operational Research, vol.214, issue.3, pp.536-545, 2011.
DOI : 10.1016/j.ejor.2011.04.037

URL : https://hal.archives-ouvertes.fr/hal-00616366

R. Marsten, W. Hogan, and J. Blankenship, Method for Large-Scale Optimization, Operations Research, vol.23, issue.3, pp.389-405, 1975.
DOI : 10.1287/opre.23.3.389

M. G. Azi and J. Potvin, An exact algorithm for a single-vehicle routing problem with time windows and multiple routes, European Journal of Operational Research, vol.178, issue.3, pp.755-766, 2007.
DOI : 10.1016/j.ejor.2006.02.019

A. Oukil, H. B. Amor, J. Desrosiers, and H. E. Gueddari, Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems, Computers & Operations Research, vol.34, issue.3, pp.817-834, 2007.
DOI : 10.1016/j.cor.2005.05.011

R. Sadykov and F. Vanderbeck, Column Generation for Extended Formulations, Electronic Notes in Discrete Mathematics, vol.37, pp.357-362, 2011.
DOI : 10.1016/j.endm.2011.05.061

URL : https://hal.archives-ouvertes.fr/hal-00661758

A. Scholl, R. Klein, and C. Jurgens, Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Computers & Operations Research, vol.24, issue.7, pp.627-645, 1997.
DOI : 10.1016/S0305-0548(96)00082-2

C. Shetty and R. Taylor, Solving large-scale linear programs by aggregation, Computers & Operations Research, vol.14, issue.5, pp.385-393, 1987.
DOI : 10.1016/0305-0548(87)90035-9

F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock problems, Mathematical Programming, vol.86, issue.3, pp.565-594, 1999.
DOI : 10.1007/s101070050105

F. Vanderbeck and M. W. Savelsbergh, A generic view of Dantzig???Wolfe decomposition in mixed integer programming, Operations Research Letters, vol.34, issue.3, pp.296-306, 2006.
DOI : 10.1016/j.orl.2005.05.009

URL : https://hal.archives-ouvertes.fr/inria-00342623

M. V. Vyve and L. A. Wolsey, Approximate extended formulations, Mathematical Programming, pp.501-522, 2006.
DOI : 10.1007/s10107-005-0663-7