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.
DOI : 10.1287/opre.1110.0975

F. Barahona and R. Anbil, The volume algorithm: producing primal solutions with a subgradient method, Mathematical Programming, vol.87, issue.3, pp.385-399, 2000.
DOI : 10.1007/s101070050002

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.
DOI : 10.1057/jors.1990.166

W. Ben-ameur and J. Neto, Acceleration of cutting-plane and column generation algorithms: Applications to network design, Networks, vol.3, issue.5, pp.3-17, 2007.
DOI : 10.1002/net.20137

O. Briant, C. Lemaréchal, . Ph, S. Meurdesoif, N. Michel 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-00070554

P. M. Camerini, L. Fratta, and F. Maffioli, On improving relaxation methods by modified gradient techniques, pp.26-34, 1975.
DOI : 10.1007/BFb0120697

M. Côté, B. Gendron, and L. Rousseau, Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling, INFORMS Journal on Computing, vol.25, issue.3, pp.461-474, 2013.
DOI : 10.1287/ijoc.1120.0514

W. De-oliveira and C. Sagastizábal, Level bundle methods for oracles with on-demand accuracy, Optimization Methods and Software, vol.152, issue.2, pp.1180-1209, 2014.
DOI : 10.1007/s12532-012-0038-z

S. Demassey, G. Pesant, and L. Rousseau, A Cost-Regular Based Hybrid Column Generation Approach, Constraints, vol.12, issue.4???5, pp.315-333, 2006.
DOI : 10.1007/s10601-006-9003-7
URL : https://hal.archives-ouvertes.fr/hal-00293562

D. Olivier-du-merle, J. Villeneuve, P. Desrosiers, and . 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, G. Desaulniers, and F. Soumis, An Improved Primal Simplex Algorithm for Degenerate Linear Programs, INFORMS Journal on Computing, vol.23, issue.4, pp.569-577, 2011.
DOI : 10.1287/ijoc.1100.0425

M. Fischetti and D. Salvagnin, An In-Out Approach to Disjunctive Optimization, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.136-140, 2010.
DOI : 10.1007/978-3-642-13520-0_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.566.1064

A. Frangioni and E. Gorgone, Bundle methods for sum-functions with ???easy??? components: applications to multicommodity network design, Mathematical Programming, vol.2, issue.1, pp.133-161, 2014.
DOI : 10.1007/s10107-013-0642-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.7883

J. Goffin and J. Vial, Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method. Optimization Methods and Software, pp.805-867, 2002.

J. Gondzio, P. González-brevis, and P. Munari, New developments in the primal???dual column generation technique, European Journal of Operational Research, vol.224, issue.1, pp.41-51, 2013.
DOI : 10.1016/j.ejor.2012.07.024

A. Frangioni, H. Ben-amor, and J. Desrosiers, On the choice of explicit stabilizing terms in column generation, Discrete Applied Mathematics, vol.157, issue.6, pp.1167-1184, 2009.

C. Lee and S. Park, Chebyshev center based column generation, Discrete Applied Mathematics, vol.159, issue.18, pp.2251-2265, 2011.
DOI : 10.1016/j.dam.2011.08.009
URL : http://doi.org/10.1016/j.dam.2011.08.009

C. Lemaréchal, A. Nemirovskii, and Y. Nesterov, New variants of bundle methods, Mathematical Programming, pp.111-147, 1995.
DOI : 10.1007/BF01585555

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

P. Munari and J. Gondzio, Using the primal-dual interior point algorithm within the branch-price-and-cut method, Computers & Operations Research, vol.40, issue.8, pp.2026-2036, 2013.
DOI : 10.1016/j.cor.2013.02.028
URL : http://dx.doi.org/10.1016/j.cor.2013.02.028

R. J. Patric and . Östergård, A new algorithm for the maximum-weight clique problem, Nordic Journal of Computing, vol.8, pp.424-436, 2001.

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, In-Out Separation and Column Generation Stabilization by Dual Price Smoothing, Symposium on Experimental Algorithms, pp.354-365, 2013.
DOI : 10.1007/978-3-642-38527-8_31
URL : https://hal.archives-ouvertes.fr/hal-00750412

A. Pessoa, E. Uchoa, M. Poggi-de-aragão, and R. Rodrigues, Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems, Mathematical Programming Computation, vol.4, issue.2, pp.259-290, 2010.
DOI : 10.1007/s12532-010-0019-z

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

C. N. Potts, N. Luk, and . Van-wassenhove, A Branch and Bound Algorithm for the Total Weighted Tardiness Problem, Operations Research, vol.33, issue.2, pp.363-377, 1985.
DOI : 10.1287/opre.33.2.363

P. A. Rey and C. A. Sagastizabal, Dynamical adjustment of the prox-parameter in variable metric bundle methods. Optimization, pp.423-447, 2002.

R. Sadykov, A. A. Lazarev, V. Shiryaev, and A. Stratonnikov, Solving a freight railcar flow problem arising in russia, 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems of OpenAccess Series in Informatics (OASIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.55-67, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00857914

F. Vanderbeck, Implementing Mixed Integer Column Generation, Column Generation, pp.331-358, 2005.
DOI : 10.1007/0-387-25486-2_12
URL : https://hal.archives-ouvertes.fr/inria-00342630

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

F. Vanderbeck, Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem, Mathematical Programming, vol.94, issue.1, pp.125-136, 2002.
DOI : 10.1007/s10107-002-0300-7

P. Wentges, Weighted dantzig?wolfe decomposition for linear mixed-integer programming, International Transactions in Operational Research, vol.4, issue.2, pp.151-162, 1997.
DOI : 10.1016/s0969-6016(97)00001-4

M. Yagiura, T. Ibaraki, and F. Glover, A path relinking approach with ejection chains for the generalized assignment problem, European Journal of Operational Research, vol.169, issue.2, pp.548-569, 2006.
DOI : 10.1016/j.ejor.2004.08.015

I. Williard and . Zangwill, A backlogging model and a multi-echelon model of a dynamic economic lot size production system-a network approach, Management Science, vol.15, issue.9, pp.506-527, 1969.