.png){kind=icon}
.png){kind=icon}
Return
A parallel branch-and-bound-and-check algorithm for nesting
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2026.107535.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• An ad hoc exact branch-and-bound-and-check algorithm for discrete nesting. • Our algorithm solves the Dotted-Board MILP model efficiently without preprocessing. • Our algorithm significantly outperforms current MILP models in most problem instances. • Our algorithm solves seventeen open instances and outperforms Gurobi and Google CPSat. • A new lower-bound algorithm for nesting finds 51 optimal solutions in a few minutes.
Keywords:
Exact algorithm
Irregular strip packing
Dotted-Board model
Integer programming
Branch-and-bound-and-check
Forward-checking
Complete tree search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
204
Citations:
0
Organization
No organization information available