Citations (19)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (2)
K. Yoon, S. Ahn & M. Kang. (2013) An improved best-first branch-and-bound algorithm for constrained two-dimensional guillotine cutting problems. International Journal of Production Research 51:6, pages 1680-1693.
Read now
Read now
Biswajit Mahanty, Rajneesh
Kumar Agrawal, Shrikrishna Shrin & Sourish Chakravarty. (2007) Hybrid Approach to Optimal Packing Using Genetic Algorithm and Coulomb Potential Algorithm. Materials and Manufacturing Processes 22:5, pages 668-677.
Read now
Read now
Articles from other publishers (17)
Óscar Oliveira, Dorabela Gamboa & Elsa Silva. (2022) An introduction to the two‐dimensional rectangular cutting and packing problem. International Transactions in Operational Research 30:6, pages 3238-3266.
Crossref
Crossref
Si Thu Thant Sin, E. M. Portnov & A. M. Bain. (2023) Using the Branch and Bound Method to Solve the Optimal Packaging Problem. Using the Branch and Bound Method to Solve the Optimal Packaging Problem.
Henrique Becker, Mateus Martin, Olinto Araujo, Luciana S. Buriol & Reinaldo Morabito. (2023) Comparative analysis of mathematical formulations for the two‐dimensional guillotine cutting problem. International Transactions in Operational Research.
Crossref
Crossref
Felix Prause, Kai Hoppmann-Baum, Boris Defourny & Thorsten Koch. (2021) The maximum diversity assortment selection problem. Mathematical Methods of Operations Research 93:3, pages 521-554.
Crossref
Crossref
Mauro Russo, Maurizio Boccia, Antonio Sforza & Claudio Sterle. (2019) Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization. International Transactions in Operational Research 27:2, pages 794-834.
Crossref
Crossref
Vittorio Bertolini, Carlos Rey, Mauricio Sepulveda & Victor Parada. (2018) Novel Methods Generated by Genetic Programming for the Guillotine-Cutting Problem. Scientific Programming 2018, pages 1-13.
Crossref
Crossref
Mauro Russo, Antonio Sforza & Claudio Sterle. 2017. Optimization and Decision Science: Methodologies and Applications. Optimization and Decision Science: Methodologies and Applications
461
472
.
Lijun Wei & Andrew Lim. (2015) A bidirectional building approach for the 2D constrained guillotine knapsack packing problem. European Journal of Operational Research 242:1, pages 63-71.
Crossref
Crossref
Lei Huang, Zhong Liu & Zhi Liu. (2014) An improved lowest-level best-fit algorithm with memory for the 2D rectangular packing problem. An improved lowest-level best-fit algorithm with memory for the 2D rectangular packing problem.
Ender Özcan, Zhang Kai & John H. Drake. (2013) Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing. Expert Systems with Applications 40:10, pages 4035-4043.
Crossref
Crossref
Jesica de Armas, Gara Miranda & Coromoto León. (2012) Improving the efficiency of a best-first bottom-up approach for the Constrained 2D Cutting Problem. European Journal of Operational Research 219:2, pages 201-213.
Crossref
Crossref
Stephen C.H. Leung & Defu Zhang. (2011) A fast layer-based heuristic for non-guillotine strip packing. Expert Systems with Applications 38:10, pages 13032-13042.
Crossref
Crossref
Frank G. Ortmann, Nthabiseng Ntene & Jan H. van Vuuren. (2010) New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems. European Journal of Operational Research 203:2, pages 306-315.
Crossref
Crossref
Francis J. Vasko & Christopher L. Bartkowski. (2009) Using Wang's two‐dimensional cutting stock algorithm to optimally solve difficult problems. International Transactions in Operational Research 16:6, pages 829-838.
Crossref
Crossref
E. K. Burke, G. Kendall & G. Whitwell. (2004) A New Placement Heuristic for the Orthogonal Stock-Cutting Problem. Operations Research 52:4, pages 655-671.
Crossref
Crossref
Ramón Alvarez-Valdés, Antonio Parajón & Jose’e Manuel Tamarit. (2002) A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Computers & Operations Research 29:7, pages 925-947.
Crossref
Crossref
V‐D. Cung, M. Hifi & B. Le Cun. (2006) Constrained two‐dimensional cutting stock problems a best‐first branch‐and‐bound algorithm. International Transactions in Operational Research 7:3, pages 185-210.
Crossref
Crossref