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

Robert W. Haessler
Additional contact information
Robert W. Haessler: University of Michigan, Ann Arbor, Michigan

Operations Research, 1980, vol. 28, issue 4, 1001-1005

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.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.4.1001 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:4:p:1001-1005

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().