We consider several formulations of two-dimensional two-stage constrained cutting, where the number of variables is polynomial. Some new models with variable strip widths are developed. Symmetries in the search space are eliminated by lexicographic constraints which are already known from the literature. However, previously known models with fixed strip widths are shown to be more effective. The models are solved with the branch-and-cut algorithm of ILOG CPLEX.

Postscript, PDF,

Back