Bounds for two-dimensional cutting, Journal of the Operational Research Society, vol.36, no.1, 1985, pp71-74

This paper considers the problem of cutting rectangular pieces from a single large rectangle so as to maximise the value of the pieces cut. A number of bounds that can be used in any tree search procedure for the problem are derived from a zero-one formulation of the problem. Computational results are presented.

Full paper from journal publishers

J E Beasley