A note on "Reducing the number of binary variables in cutting stock problems"

Abstract

This study proposes a deterministic model to solve the two-dimensional cutting stock problem (2DCSP) using a much smaller number of binary variables and thereby reducing the complexity of 2DCSP. Expressing a 2DCSP with stocks and cutting rectangles requires binary variables in the traditional model. In contrast, the proposed model uses binary variables to express the 2DCSP. Experimental results showed that the proposed model is more efficient than the existing model.