In this paper, we propose three algorithms for approximately solving the circular open dimension problem, known also as the circular strip cutting/ packing problem. We first propose an open strip generation solution procedure that uses the best local position rule into the open strip. Second, we...

In this paper, we study the constrained circular cutting problem whose objective is to cut a set of circular pieces into a rectangular plate R of dimensions L × W. Each piece's type i, i = 1, …, m is caracterized by its radius r(i) and its demand b(i). This problem is solved using an adaptive...