References
- Álvarez-Valdés, R., Parajón, A., & Tamarit, J. M. (2002). A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Computers & Operations Research, 29(7), 925–947. https://doi.org/https://doi.org/10.1016/S0305-0548(00)00095-2
- Amossen, R. R., & Pisinger, D. (2010). Multi-dimensional bin packing problems with guillotine constraints. Computers & Operations Research, 37(11), 1999–2006. https://doi.org/https://doi.org/10.1016/j.cor.2010.01.017
- Beasley, J. E. (1985). Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society, 36(4), 297–306. https://doi.org/https://doi.org/10.2307/2582416
- Ben Messaoud, S., Chu, C., & Espinouse, M. L. (2008). Characterization and modelling of guillotine constraints. European Journal of Operational Research, 191(1), 112–124. 2007.08.029. https://doi.org/https://doi.org/10.1016/j.ejor
- Christofides, N., & Hadjiconstantinou, E. (1995). An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. European Journal of Operational Research, 83(1), 21–38. https://doi.org/https://doi.org/10.1016/0377-2217(93)E0277-5
- Christofides, N., & Whitlock, C. (1977). An algorithm for two-dimensional cutting problems. Operations Research, 25(1), 30–44. https://doi.org/https://doi.org/10.1287/opre.25.1.30
- Cung, V.-D., Hifi, M., & Cun, B. (2000). Constrained two-dimensional cutting stock problems a best- first branch-and-bound algorithm. International Transactions in Operational Research, 7(3), 185–210. https://doi.org/https://doi.org/10.1111/j.1475-3995.2000.tb00194.x
- De Queiroz, T. A., Hokama, P. H. D. B., Schouery, R. C. S., & Miyazawa, F. K. (2017). Two-dimensional disjunctively constrained knapsack problem: Heuristic and exact approaches. Computers & Industrial Engineering, 105, 313–328. https://doi.org/https://doi.org/10.1016/j.cie.2017.01.015
- De Queiroz, T. A., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2012). Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, 39(2), 200–212. https://doi.org/https://doi.org/10.1016/j.cor.2011.03.011
- Do Nascimento, O. X., De Queiroz, T. A., & Junqueira, L. (2019). A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts. Annals of Operations Research. https://doi.org/https://doi.org/10.1007/s10479-019-03466-x.
- Dolatabadi, M., Lodi, A., & Monaci, M. (2012). Exact algorithms for the two-dimensional guillotine knapsack. Computers & Operations Research, 39(1), 48–53. https://doi.org/https://doi.org/10.1016/j.cor.2010.12.018
- Fayard, D., Hifi, M., & Zissimopoulos, V. (1998). An efficient approach for large-scale two-dimensional guillotine cutting stock problems. Journal of the Operational Research Society, 49(12), 1270–1277. https://doi.org/https://doi.org/10.1057/palgrave.jors.2600638
- Furini, F., Malaguti, E., & Thomopulos, D. (2016). Modeling two-dimensional guillotine cutting problems via integer programming. INFORMS Journal on Computing, 28(4), 736–751. https://doi.org/https://doi.org/10.1287/ijoc.2016.0710
- Hifi, M. (2002). Approximate algorithms for the container loading problem. International Transactions in Operational Research, 9(6), 747–774. https://doi.org/https://doi.org/10.1111/1475-3995.00386
- Hifi, M. (2004). Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study. Computers & Operations Research, 31(5), 657–674. https://doi.org/https://doi.org/10.1016/S0305-0548(03)00019-4
- Martin, M., Birgin, E. G., Lobato, R. D., Morabito, R., & Munari, P. (2020). Models for the two-dimensional rectangular single large placement problem with guillotine cuts and constrained pattern. International Transactions in Operational Research, 27(2), 767–793. 12703. https://doi.org/https://doi.org/10.1111/itor
- Martin, M., Morabito, R., & Munari, P. (2020). A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem. Computers & Operations Research, 115, 104851. https://doi.org/https://doi.org/10.1016/j.cor.2019.104851
- Martin, M., Oliveira, J. F., Silva, E., Morabito, R., & Munari, P. (2020). Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm. Technical Report UFSCAR-DEP-2020-99 Production Engineering Department. Federal University of São Carlos Brasil.
- Morabito, R., & Arenales, M. (1994). An and/or-graph approach to the container loading problem. International Transactions in Operational Research, 1(1), 59–73. https://doi.org/https://doi.org/10.1111/1475-3995.d01-8
- Morabito, R., & Pureza, V. (2010). A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem. Annals of Operations Research, 179(1), 297–315. https://doi.org/https://doi.org/10.1007/s10479-008-0457-4
- Oliveira, J., & Ferreira, J. (1990). An improved version of Wang’s algorithm for two-dimensional cutting problems. European Journal of Operational Research, 44(2), 256–266. https://doi.org/https://doi.org/10.1016/0377-2217(90)90361-E
- Parada, V., Muñoz, R., & de Alvarenga, A. G. (1995). A hybrid genetic algorithm for the two - dimensional guillotine cutting problem. In J. Biethahn & V. Nissen (Eds.), Evolutionary algorithms in management applications (pp. 183–196). Springer. https://doi.org/https://doi.org/10.1007/978-3-642-61217-6_9
- Russo, M., Boccia, M., Sforza, A., & Sterle, C. (2020). Constrained two-dimensional guillotine cutting problem: Upper-bound review and categorization. International Transactions in Operational Research, 27(2), 794–834. https://doi.org/https://doi.org/10.1111/itor.12687
- Scheithauer, G. (2018). Introduction to cutting and packing optimization: Problems, modeling approaches, solution methods. International series in operations research and management science. Springer. https://doi.org/https://doi.org/10.1007/978-3-319-64143-0
- Velasco, A. S., & Uchoa, E. (2019). Improved state space relaxation for constrained two-dimensional guillotine cutting problems. European Journal of Operational Research, 272(1), 106–120. https://doi.org/https://doi.org/10.1016/j.ejor.2018.06.016
- Viswanathan, K. V., & Bagchi, A. (1993). Best-first search methods for constrained two-dimensional cutting stock problems. Operations Research, 41(4), 768–776. https://doi.org/https://doi.org/10.1287/opre.41.4.768
- Wang, P. Y. (1983). Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 31(3), 573–586. https://doi.org/https://doi.org/10.1287/opre.31.3.573
- Wäscher, G., Haußner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109–1130. 2005.12.047. https://doi.org/https://doi.org/10.1016/j.ejor
- Yoon, K., Ahn, S., & Kang, M. (2013). An improved best-first branch-and-bound algorithm for constrained two-dimensional guillotine cutting problems. International Journal of Production Research, 51(6), 1680–1693. https://doi.org/https://doi.org/10.1080/00207543.2012.693965