activity
20172025
most citedA goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints

20 citations · 39 across the 6 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.CG2021

A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation

Sahar Chehrazad, Dirk Roose, Tony Wauters

We present a fast algorithm to solve nesting problems based on a semi-discrete representation of both the 2D non-convex pieces and the strip. The pieces and the strip are represent…