Near-optimal solutions to one-dimensional cutting stock problems (Q1091269): Difference between revisions

This paper describes a set of heuristic procedures for efficiently generating good solutions to one-dimensional cutting stock problems in which (i) there are multiple stock lengths with constraints on their availability, (ii) it is desirable to cut the trim into as few pieces as possible and (iii) it is difficult because of the problem's structure, to round fractional, LP solutions to good feasible cutting plans. The point of departure for the procedures is the column generation technique of Gilmore and Gomory. The computational experience reported here suggests that the heuristics are both effective and efficient.