In this paper, we study the sensitivity of the optimum of a max-min combinatorial optimization problem, namely the Knapsack Sharing Problem (KSP), to the perturbation of the profit of an arbitrary item. We mainly establish the interval limits of each perturbed item by applying a reduction of the...

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...

In this paper, we propose to solve the circular packing problem (CPP) whose objective is to pack n different circles C(i) of known radius r(i) , i = 1, …, n into the smallest containing circle C. The objective is to determine the radius r of C as well as the coordinates (x(i) , y(i)) of the...