J. O. Berkey and W. P. , Two-Dimensional Finite Bin-Packing Algorithms, Journal of the Operational Research Society, vol.38, issue.5, pp.423-429, 1987.
DOI : 10.1057/jors.1987.70

A. Bortfeldt, A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces, European Journal of Operational Research, vol.172, issue.3, pp.814-837, 2006.
DOI : 10.1016/j.ejor.2004.11.016

E. Burke, G. Kendall, and G. Whitwell, A New Placement Heuristic for the Orthogonal Stock-Cutting Problem, Operations Research, vol.52, issue.4, pp.697-707, 2004.
DOI : 10.1287/opre.1040.0109

E. Burke, G. Kendall, and G. Whitwell, Metaheuristic enhancements of the best-fit heuristic for the orthogonal stock cutting problem, 2006.

B. Chazelle, The bottom left bin packing heuristic : an efficient implementation, IEEE Transactions on Computers, vol.32, pp.697-707, 1983.

E. Hopper, Two-Dimensional Packing Utilising Evolutionary Algorithms and other Meta- Heuristic Methods, 2000.

E. Hopper and B. C. Turton, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, European Journal of Operational Research, vol.128, issue.1, pp.34-57, 2001.
DOI : 10.1016/S0377-2217(99)00357-4

M. Iori, S. Martello, and M. Monaci, Metaheuristic Algorithms for the Strip Packing Problem, 13] N. Lesh, J. Marks, A. Mc. Mahon, and M. Mitzenmacher . Exhaustive approaches to 2d rectangular perfect packings. Information Processing Letters, pp.159-1797, 2003.
DOI : 10.1007/978-1-4613-0233-9_7

N. Lesh, J. Marks, A. Mc, M. Mahon, and . Mitzenmacher, New heuristic and interactive approaches to 2D rectangular strip packing, Journal of Experimental Algorithmics, vol.10, pp.1-18, 2005.
DOI : 10.1145/1064546.1083322

S. Martello, M. Monaci, and D. Vigo, An Exact Approach to the Strip-Packing Problem, INFORMS Journal on Computing, vol.15, issue.3, pp.310-319, 2003.
DOI : 10.1287/ijoc.15.3.310.16082

S. Martello and D. Vigo, Excact solution of the two-dimensional finite bin packing problem, Management science, vol.15, pp.310-319, 1998.

N. Mladenovic and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2
URL : https://hal.archives-ouvertes.fr/hal-00979295

B. Neveu and G. Trombettoni, INCOP: An Open Library for INcomplete Combinatorial OPtimization, Proc. Constraint Programming, CP'03, volume LNCS 2833, pp.909-913, 2003.
DOI : 10.1007/978-3-540-45193-8_77

B. Neveu, G. Trombettoni, and F. Glover, ID Walk: A Candidate List Strategy with a Simple Diversification Device, Proc. Constraint Programming , CP'04, pp.423-437, 2004.
DOI : 10.1007/978-3-540-30201-8_32