R. Baldacci and M. Boschetti, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, European Journal of Operational Research, vol.183, issue.3, pp.1136-1149, 2007.
DOI : 10.1016/j.ejor.2005.11.060

J. Beasley, Algorithms for Unconstrained Two-Dimensional Guillotine Cutting, Journal of the Operational Research Society, vol.36, issue.4, pp.297-306, 1985.
DOI : 10.1057/jors.1985.51

J. Beasley, An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure, Operations Research, vol.33, issue.1, pp.49-64, 1985.
DOI : 10.1287/opre.33.1.49

K. Booth and G. Lueker, Linear algorithms to recognize interval graphs and test for the consecutive ones property, Proceedings of seventh annual ACM symposium on Theory of computing , STOC '75, pp.255-265, 1975.
DOI : 10.1145/800116.803776

A. Caprara and M. Monaci, On the two-dimensional Knapsack Problem, Operations Research Letters, vol.32, issue.1, pp.5-14, 2004.
DOI : 10.1016/S0167-6377(03)00057-9

J. Carlier, F. Clautiaux, and A. Moukrim, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, Computers & Operations Research, vol.34, issue.8, pp.2223-2250, 2007.
DOI : 10.1016/j.cor.2005.08.012

N. Christofides and E. Hadjiconstantinou, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, European Journal of Operational Research, vol.83, issue.1, pp.21-38, 1995.
DOI : 10.1016/0377-2217(93)E0277-5

F. Clautiaux, J. Carlier, and A. Moukrim, A new exact method for the two-dimensional orthogonal packing problem, European Journal of Operational Research, vol.183, issue.3, pp.1196-1211, 2007.
DOI : 10.1016/j.ejor.2005.12.048

F. Clautiaux, A. Jouglet, J. Carlier, and A. Moukrim, A new constraint programming approach for the orthogonal packing problem, Computers & Operations Research, vol.35, issue.3, pp.944-959, 2008.
DOI : 10.1016/j.cor.2006.05.012
URL : https://hal.archives-ouvertes.fr/hal-01378284

S. Fekete and J. Schepers, On more-dimensional packing i: Modeling, 1997.

S. Fekete and J. Schepers, On more-dimensional packing iii: Exact algorithms, 1997.

S. Fekete, J. Schepers, and J. Van-der-veen, An Exact Algorithm for Higher-Dimensional Orthogonal Packing, Operations Research, vol.55, issue.3, pp.569-587, 2007.
DOI : 10.1287/opre.1060.0369

E. Ferreira and J. Oliveira, A note on fekete and schepers' algorithm for the non-guillotinable twodimensional packing problem, 2005.

D. Fulkerson and O. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.
DOI : 10.2140/pjm.1965.15.835

A. Ghouila-houri, Caractérisation des graphes non orientes dont on peut orienter les aretes de maniere à obtenir le graphe d'une rélation d'ordre, Comptes Rendus Mathématique Académie des Sciences Paris, vol.254, pp.1370-1371, 1962.

P. Gilmore and A. Hoffman, A characterization of comparability graphs and of interval graphs, Journal canadien de math??matiques, vol.16, issue.0, pp.539-548, 1964.
DOI : 10.4153/CJM-1964-055-5

N. Korte and R. Möhring, An Incremental Linear-Time Algorithm for Recognizing Interval Graphs, SIAM Journal on Computing, vol.18, issue.1, pp.68-81, 1989.
DOI : 10.1137/0218005

D. Rose, R. Tarjan, and G. Lueker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Journal on Computing, vol.5, issue.2, pp.266-283, 1976.
DOI : 10.1137/0205021