simple polygons that may contain holes are studied in which we propose algorithms based
on no-fit polygon computation. We present a GRASP based heuristic for the 0/1 version of
the knapsack problem, and another heuristic for the unconstrained version of the knapsack
problem. This last heuristic is divided in two steps: first it packs items in rectangles and then
use the rectangles as items to be packed into the bin. We also solve the cutting stock …