Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm

Publisher Website
Google Scholar
Abstract
This note describes modifications to the Gilmore-Gomory cutting stock algorithm that improve the characteristics (other than trim loss) of the solutions generated. Changes are proposed for the procedures that generate the initial solution and subsequent basis entering patterns. The major point is that controlling the pattern generation by using a more restrictive and therefore less efficient formulation of the knapsack problem may reduce rounding problems and pattern changes, and generally broaden the scope of applications of the algorithm. A set of sample problems is solved and computational times are provided.

This publication has 0 references indexed in Scilit: