What type of study is this?

October 12, 2025Open Access

A parallel branch-and-bound-and-prune algorithm for irregular strip packing with discrete rotations

View Full Paper

Ask AI

Bookmark

The proposed algorithm significantly decreases resolution time for the irregular strip packing problem.
Experiments show that this method performs better than the existing DB-CC model in efficiency.
A novel lower-bound algorithm and two ILP reformulations are introduced to enhance the packing process.
Seventeen open instances of the problem are solved optimally using this new approach.

No takes yet. Share an insight, caveat, or question.

Proposed algorithm reduces resolution time in irregular strip packing, suggesting efficiency over traditional models.

Lastra-Díaz et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark