R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms and Applications, 1993.

J. F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol.38, issue.1, pp.238-252, 1962.
DOI : 10.1007/BF01386316

L. Bigras, M. Gamache, and G. Savard, Time-Indexed Formulations and the Total Weighted Tardiness Problem, INFORMS Journal on Computing, vol.20, issue.1, pp.133-142, 2008.
DOI : 10.1287/ijoc.1070.0225

K. L. Croxton, B. Gendron, and T. L. Magnanti, Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs, Operations Research, vol.55, issue.1, pp.146-157, 2007.
DOI : 10.1287/opre.1060.0314

G. Desaulniers, Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows, Operations Research, vol.58, issue.1, pp.179-192, 2010.
DOI : 10.1287/opre.1090.0713

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, Vehicle routing with time windows and split deliveries, 2006.

D. Feillet, M. Gendreau, A. L. Medaglia, and J. L. Walteros, A note on branch-and-cut-and-price, Operations Research Letters, vol.38, issue.5, pp.346-353, 2010.
DOI : 10.1016/j.orl.2010.06.002
URL : https://hal.archives-ouvertes.fr/emse-00528021

M. Fischetti and D. Vigo, A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem, Networks, vol.29, issue.1, pp.55-67, 1996.
DOI : 10.1002/(SICI)1097-0037(199701)29:1<55::AID-NET6>3.0.CO;2-B

A. Frangioni and B. Gendron, 0???1 reformulations of the multicommodity capacitated network design problem, Discrete Applied Mathematics, vol.157, issue.6, pp.1229-1241, 2009.
DOI : 10.1016/j.dam.2008.04.022

A. Frangioni and B. Gendron, A stabilized structured Dantzig???Wolfe decomposition method, Mathematical Programming, vol.139, issue.1, 2010.
DOI : 10.1007/s10107-012-0626-8

K. L. Jones, I. J. Lustig, J. M. Farvolden, and W. B. Powell, Multicommodity network flows: The impact of formulation on decomposition, Mathematical Programming, pp.95-117, 1993.
DOI : 10.1007/BF01585162

V. Kaibel and A. Loos, Branched Polyhedral Systems, Integer Programming and Combinatorial Optimization, pp.177-190, 2010.
DOI : 10.1007/978-3-642-13036-6_14

J. W. Mamer and R. D. Mcbride, A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem, Management Science, vol.46, issue.5, pp.693-709, 2000.
DOI : 10.1287/mnsc.46.5.693.12042

R. K. Martin, R. L. Rardin, and B. A. Campbell, Polyhedral Characterization of Discrete Dynamic Programming, Operations Research, vol.38, issue.1, pp.127-138, 1990.
DOI : 10.1287/opre.38.1.127

I. Muter, I. Birbil, and K. Bülbül, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Mathematical Programming, vol.29, issue.9, 2010.
DOI : 10.1007/s10107-012-0561-8

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

Y. Pochet and L. A. Wolsey, Production planning by mixed integer programming, 2006.

C. N. Potts and L. N. 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

J. M. Valério-de-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

J. M. Valério-de-carvalho, Exact solution of bin packing problems using column generation and branch and bound, Annals of Operations Research, vol.86, pp.629-659, 1999.
DOI : 10.1023/A:1018952112615

J. M. Van-den-akker, J. A. Hoogeveen, and S. L. Van-de-velde, Parallel Machine Scheduling by Column Generation, Operations Research, vol.47, issue.6, pp.862-872, 1999.
DOI : 10.1287/opre.47.6.862

J. M. Van-den-akker, C. A. Hurkens, and M. W. Savelsbergh, Time-Indexed Formulations for Machine Scheduling Problems: Column Generation, INFORMS Journal on Computing, vol.12, issue.2, pp.111-124, 2000.
DOI : 10.1287/ijoc.12.2.111.11896

M. Van-vyve and L. A. Wolsey, Approximate extended formulations, Mathematical Programming, vol.48, issue.2-3, pp.501-522, 2006.
DOI : 10.1007/s10107-005-0663-7

F. Vanderbeck, Bapcod ? a branch-and-price generic code

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 and L. A. Wolsey, Reformulation and Decomposition of Integer Programs, 50 Years of Integer Programming, pp.431-502, 1958.
DOI : 10.1007/978-3-540-68279-0_13
URL : https://hal.archives-ouvertes.fr/inria-00392254

P. Wentges, Weighted Dantzig?Wolfe decomposition for linear mixed-integer programming, International Transactions in Operational Research, vol.4, issue.2, pp.151-162, 1997.