C. Barnhart, C. A. Hane, and P. H. Vance, Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems, Operations Research, vol.48, issue.2, pp.318-326, 2000.
DOI : 10.1287/opre.48.2.318.12378

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. Savelsbergh, and P. H. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.197.7390

G. Belov, A. N. Letchford, and E. Uchoa, A Node-Flow Model for the 1D Stock Cutting: Robust Branch-Cut-and-Price, Tech. report RPEP, vol.5, issue.7, 2005.

O. Briant, C. Lemaréchal, . Ph, S. Meurdesoif, N. Michel et al., Comparison of bundle and classical column generation, Mathematical Programming, vol.94, issue.1, pp.299-344, 2008.
DOI : 10.1007/s10107-006-0079-z
URL : https://hal.archives-ouvertes.fr/inria-00070554

A. Chabrier, Génération de Colonnes et de Coupes utilisant des sous-problèmes de plus court chemin, Thèse de doctorat, 2003.

F. Eisenbrand and G. Shmonin, Carath??odory bounds for integer cones, Operations Research Letters, vol.34, issue.5, pp.564-568, 2006.
DOI : 10.1016/j.orl.2005.09.008
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1908

M. Gendreau, P. Dejax, D. Feillet, and C. Gueguen, Vehicle Routing with Time Windows and Split Deliveries, 2005.

A. Geoffrion, Lagrangian Relaxation for Integer Programming, Math. Prog. St, vol.2, pp.82-114, 1974.
DOI : 10.1007/978-3-540-68279-0_9

E. Horowitz and S. Sahni, Computing Partitions with Applications to the Knapsack Problem, Journal of the ACM, vol.21, issue.2, pp.277-292, 1974.
DOI : 10.1145/321812.321823

L. Ladányi, T. K. Ralphs, L. E. Trotter, and J. , Branch, Cut, and Price: Sequential and Parallel, pp.223-269, 1998.
DOI : 10.1007/3-540-45586-8_6

M. Parker and D. M. Ryan, A column generation algorithm for bandwidth packing, Telecommunication Systems, vol.33, issue.1, pp.185-195, 1994.
DOI : 10.1007/BF02109857

J. Puchinger, P. J. Stuckey, M. Wallace, and S. Brand, From High-Level Model to Branch-and-Price Solution in G12 The Fifth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, LNCS, vol.5015, pp.218-232, 2008.

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.

M. W. Savelsbergh and G. L. Nemhauser, Functional description of MINTO, a Mixed INTeger Optimizer, 1993.

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

P. H. Vance, Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem, Computational Optimization and Applications, vol.9, issue.3, pp.211-228, 1998.
DOI : 10.1023/A:1018346107246

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, On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm, Operations Research, vol.48, issue.1, pp.111-128, 2000.
DOI : 10.1287/opre.48.1.111.12453
URL : https://hal.archives-ouvertes.fr/inria-00342641

F. Vanderbeck, Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem, Operations Research, vol.48, issue.6, pp.915-926, 2000.
DOI : 10.1287/opre.48.6.915.12391
URL : https://hal.archives-ouvertes.fr/inria-00342639

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

F. Vanderbeck, Implementing Mixed Integer Column Generation Column Generation, Kluwer. [24] F. Vanderbeck. BaPCod - A generic Branch-And-Price Code, 2005.

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

D. Villeneuve, J. Desrosiers, M. E. Lübbecke, and F. Soumis, On Compact Formulations for Integer Programs Solved by Column Generation, Annals of Operations Research, vol.165, issue.1, pp.375-388, 2005.
DOI : 10.1007/s10479-005-3455-9

. Xpress-mp, User guide and Reference Manual, 2007.