An efficient approach for large-scale two-dimensional guillotine cutting stock problems

We present an efficient method for solving approximately both constrained a nd unconstrained two-dimensional cutting stock problems. The algorithm guar antees a constant approximation ratio for some versions of the problem. The performance of the proposed algorithm is evaluated on several large-scale randomly generated problem instances and on many instances of the literatur e. Computational results show that our algorithm produces high-quality solu tions within reasonable computational times.