R. Andrade, E. Birgin, and R. Morabito, , 2016.

, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, International Transactions in Operational Research, vol.23, issue.1-2, pp.121-145

J. E. Beasley, , 1985.

, Algorithms for unconstrained two-dimensional guillotine cutting, Journal of the Operational Research Society, vol.36, issue.4, pp.297-306

J. O. Berkey and P. Y. Wang, , 1987.

, Two-dimensional finite bin-packing algorithms, Journal of the Operational Research Society, vol.38, issue.5, pp.423-429

G. Cintra, F. Miyazawa, Y. Wakabayashi, X. , and E. , , 2008.

, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, European Journal of Operational Research, vol.191, issue.1, pp.61-85

F. References-ii-clautiaux, R. Sadykov, F. Vanderbeck, and Q. Viaud, Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. Discrete Optimization, 2018.

M. Dolatabadi, A. Lodi, and M. Monaci, Exact algorithms for the two-dimensional guillotine knapsack, Computers & Operations Research, vol.39, issue.1, pp.48-53, 2012.

F. Dusberger and G. R. Raidl, , 2014.

, A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem, pp.85-99

F. Dusberger and G. R. Raidl, , 2015.

, Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search, Electronic Notes in Discrete Mathematics, vol.47, pp.133-140

F. References-iii-furini, E. Malaguti, R. M. Durã¡n, A. Persiani, and P. Toth, , 2012.

, A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size, European Journal of Operational Research, vol.218, issue.1, pp.251-260

F. Furini, E. Malaguti, T. , and D. , , 2016.

, Modeling two-dimensional guillotine cutting problems via integer programming, INFORMS Journal on Computing, vol.28, issue.4, pp.736-751

E. Hadjiconstantinou and M. Iori, , 2007.

, A hybrid genetic algorithm for the two-dimensional single large object placement problem

, European Journal of Operational Research, vol.183, issue.3, pp.1150-1166

W. D. Harvey and M. L. Ginsberg, Limited discrepancy search, Proceedings of the 14th international joint conference on Artificial intelligence (IJCAI'95), vol.1, pp.607-615, 1995.

S. References-iv-martello and D. Vigo, , 1998.

, Exact solution of the two-dimensional finite bin packing problem, Management Science, vol.44, issue.3, pp.388-399

J. Puchinger and G. R. Raidl, , 2007.

, Models and algorithms for three-stage two-dimensional bin packing, European Journal of Operational Research, vol.183, issue.3, pp.1304-1327

J. Puchinger, G. R. Raidl, and G. Koller, Solving a Real-World Glass Cutting Problem, pp.165-176, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01298048

M. Russo, A. Sforza, and C. Sterle, , 2014.

, An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, Computers & Operations Research, vol.50, pp.97-114

R. References-v-sadykov, F. Vanderbeck, A. Pessoa, I. Tahiri, and E. Uchoa, , 2018.

, Primal heuristics for branch-and-price: the assets of diving methods, INFORMS Journal on Computing

E. Silva, F. Alvelos, and J. M. Valério-de-carvalho, , 2010.

, An integer programming model for two-and three-stage two-dimensional cutting stock problems, European Journal of Operational Research, vol.205, issue.3, pp.699-708

F. Vanderbeck, , 2001.

, A nested decomposition approach to a three-stage, two-dimensional cutting-stock problem, Management Science, vol.47, issue.6, pp.864-879