Using GPU Computing for Solving the Two-Dimensional Guillotine Cutting Problem

Boschetti, Marco Antonio; Maniezzo, Vittorio; Strappaveccia, Francesco

doi:10.1287/ijoc.2016.0693

Cited by 8 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The constraints x ≤ l/2 and y ≤ w/2 ensure that x ࣘ x 2 and y ࣘ y 2 . Beasley (1985) proposed the first version of the top-down approach, whereas the most recent application has been presented in Boschetti et al (2016).…”

Section: Dynamic Programming Methodsmentioning

confidence: 99%

“…Beasley () proposed the first version of the top‐down approach, whereas the most recent application has been presented in Boschetti et al. ().…”

Section: C2dc Solving Approaches and Literature Reviewmentioning

confidence: 99%

“…(), and Boschetti et al. (), an increasing attention has been addressed to parallel strategies for the solution of 2DC.…”

Section: C2dc Solving Approaches and Literature Reviewmentioning

confidence: 99%

See 2 more Smart Citations

Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization

Russo¹,

Boccia

Sforza³

et al. 2019

Int Trans Operational Res

View full text Add to dashboard Cite

In the two‐dimensional (2D) cutting (2DC) problem, a large rectangular sheet has to be dissected into smaller rectangular pieces with the aim of maximizing the total profit associated with the extracted pieces. When the number of copies of each piece to be extracted is bounded, it is referred to as constrained 2DC (C2DC) problem. The C2DC has been widely studied by the operations research community for its applications and theoretical issues. In this work, we recall the best exact and heuristic solving approaches for the C2DC and we provide a review and a categorization of the available upper bounds. We also discuss improvements and combinations of these upper bounds and give directions for their effective exploitation. Finally, we demonstrate the loss of accuracy of several exact methods present in literature because of the effect of the used antiredundancy strategies on the implemented bounding criteria. This work, based on more than 90 contributions, has a twofold target. For researchers working in C2DC, it provides a useful insight on the topic. For expert practitioners, it represents a systematic collection of the main findings and achievements, posing also the basis for future research.

show abstract

Section: Dynamic Programming Methodsmentioning

confidence: 99%

“…Beasley () proposed the first version of the top‐down approach, whereas the most recent application has been presented in Boschetti et al. ().…”

Section: C2dc Solving Approaches and Literature Reviewmentioning

confidence: 99%