Several tests prove the validity of the algorithm, in particular, a numerical estimate of the asymptotic performance bound is given. We present an improved method for solving the LP relaxation of the cutting stock problem. The method is based on the relationship between column generation and Lagrange relaxation. We test our procedure on generated data sets and compare it with the traditional column generation approach. The algorithm has been tested with many examples from the literature and from random data.
Results are very encouraging in comparison with some known GAs.
Finally, our algorithm is able to reconstruct perfect rectangular puzzles with more than 20 pieces. For information on individual presentations, please contact the authors directly.