Models for the two-dimensional open-dimension rectangular packing problem
- 23 September 2025
- journal article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (7) , 1-17
Abstract
No abstract availableFunding Information
- Fundação de Amparo à Pesquisa do Estado de São Paulo (2013/07375-0)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (405702/2021-3, 408722/2023-1, 315555/2023-8, 444679/2024-3, 407005/2024-2)
- Fundação de Amparo à Pesquisa do Estado de Goiás
- Fundação de Amparo à Pesquisa do Estado de São Paulo
This publication has 25 references indexed in Scilit:
- Solving the three-dimensional open-dimension rectangular packing problem: A constraint programming modelComputers & Operations Research, 2024
- Exact solution techniques for two-dimensional cutting and packingEuropean Journal of Operational Research, 2021
- Grids for cutting and packing problems: a study in the 2D knapsack problem4OR, 2019
- Introduction to Cutting and Packing Optimization2018
- Models and algorithms for packing rectangles into the smallest squareComputers & Operations Research, 2015
- Dynamic reduction heuristics for the rectangle packing area minimization problemEuropean Journal of Operational Research, 2015
- Optimal rectangle packingAnnals of Operations Research, 2008
- An improved typology of cutting and packing problemsEuropean Journal of Operational Research, 2007
- A genetic algorithm for solving the two-dimensional assortment problemComputers & Industrial Engineering, 2006
- A mixed-integer programming model for a class of assortment problemsEuropean Journal of Operational Research, 1993