A. Lodi, S. Martello, and D. Vigo, Recent advances on two-dimensional bin packing problems, Discrete Applied Mathematics, vol.123, issue.1-3, pp.373-390, 2002.
DOI : 10.1016/S0166-218X(01)00347-X

H. Dyckhoff, G. Scheithauer, and J. Terno, Cutting and packing: An annotated bibliography, Annotated Bibliographies in Combinatorial Optimization, pp.393-412, 1997.

A. Fritsch, Verschnittoptimierung durch iteriertes Matching, Master's thesis, 1994.

J. Puchinger, G. R. Raidl, and G. Koller, Solving a Real-World Glass Cutting Problem, Evolutionary Computation in Combinatorial Optimization ? EvoCOP, pp.162-173, 2004.
DOI : 10.1007/978-3-540-24652-7_17
URL : https://hal.archives-ouvertes.fr/hal-01298048

G. Wäscher, H. Haussner, and H. Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research, vol.this issue

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

J. O. Berkey and P. Y. Wang, Two-Dimensional Finite Bin-Packing Algorithms, The Journal of the Operational Research Society, vol.38, issue.5, pp.423-429, 1987.
DOI : 10.2307/2582731

P. C. Gilmore and R. E. 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. C. Gilmore and R. E. Gomory, Multistage Cutting Stock Problems of Two and More Dimensions, Operations Research, vol.13, issue.1, pp.90-120, 1965.
DOI : 10.1287/opre.13.1.94

J. F. Oliveira and J. S. Ferreira, A faster variant of the Gilmore and Gomory technique for cutting stock problems, JORBEL ? Belgium Journal of Operations Research Statistics and Computer Science, vol.34, issue.1, pp.23-38, 1994.

M. Monaci and P. Toth, A Set-Covering-Based Heuristic Approach for Bin-Packing Problems, INFORMS Journal on Computing, vol.18, issue.1, 2003.
DOI : 10.1287/ijoc.1040.0089

A. Lodi, S. Martello, and D. Vigo, Models and Bounds for Two-Dimensional Level Packing Problems, Journal of Combinatorial Optimization, vol.8, issue.3, pp.363-379, 2004.
DOI : 10.1023/B:JOCO.0000038915.62826.79

F. Vanderbeck, A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem, Management Science, vol.47, issue.6, pp.864-879, 1998.
DOI : 10.1287/mnsc.47.6.864.9809
URL : https://hal.archives-ouvertes.fr/inria-00342635

E. Hopper, Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods, 2000.

S. Martello and D. Vigo, Exact Solution of the Two-Dimensional Finite Bin Packing Problem, Management Science, vol.44, issue.3, pp.388-399, 1998.
DOI : 10.1287/mnsc.44.3.388

D. Pisinger and M. Sigurd, Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem, INFORMS Journal on Computing, vol.19, issue.1, 2003.
DOI : 10.1287/ijoc.1060.0181

M. M. Sigurd, Column Generation Methods and Application, 2004.

A. Lodi, S. Martello, and D. Vigo, Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems, INFORMS Journal on Computing, vol.11, issue.4, pp.345-357, 1999.
DOI : 10.1287/ijoc.11.4.345

J. Puchinger and G. R. , An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing, Parallel Problem Solving from Nature -PPSN VIII, pp.642-651, 2004.
DOI : 10.1007/978-3-540-30217-9_65
URL : https://hal.archives-ouvertes.fr/hal-01299556

G. Desaulniers, J. Desrosiers, and M. M. Solomon, Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems, Essays and Surveys in Metaheuristics, pp.309-324, 2001.
DOI : 10.1007/978-1-4615-1507-4_14

P. C. Gilmore and R. E. Gomory, A linear programming approach to the cuttingstock problem (part II), Operations Research, vol.11, pp.363-888, 1963.

M. Lübbecke and J. Desrosiers, Selected topics in column generation, Les Cahiers du GERAD G-2002-64, HEC Montréal, Canada, under revision for Operations Research, 2002.

H. Ben-amor, J. Desrosiers, and J. Valério-de-carvalho, Dual-Optimal Inequalities for Stabilized Column Generation, Operations Research, vol.54, issue.3, 2003.
DOI : 10.1287/opre.1060.0278

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

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

A. Martin, General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms, Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions, pp.1-25, 2001.
DOI : 10.1007/3-540-45586-8_1

G. R. Filho and L. A. Lorena, Constructive genetic algorithm and column generation: an application to graph coloring, Proceedings of APORS 2000 - The Fifth Conference of the Association of Asian-Pacific Operations Research Societies within IFORS, 2000.

Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 1996.

R. Lougee-heimer, The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community, IBM Journal of Research and Development, vol.47, issue.1, pp.57-66, 2003.
DOI : 10.1147/rd.471.0057