.png){kind=icon}
.png){kind=icon}
Return
Mixed-Integer and Constraint Programming Models for the Two-Dimensional Guillotine Cutting Problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2025.10.022.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Small oriented rectangles cut from a large rectangular plate via guillotine cuts. • Our modelling approach formulates the problem as a binary tree of guillotine cuts. • Our mixed-integer and constraint programming models solve the problem exactly. • Our constraint program benefits from cumulative scheduling relaxations. • Our polynomial size models are highly competitive with the state of the art.
Keywords:
Cutting and Packing
Two-dimensional Knapsack Problem
Exact Approach
Constraint Programming
Mixed-Integer Linear Programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W