Number of Patterns in Cutting Stock Problem Grows Exponentially

43 Views Asked by At

Consider the cutting stock problem where $L$ is the length of the stock and $n$ is the total number of patterns. If customer demands are any length between $1, 2, \ldots, L$, why is it the case that $n \geq 2^{\sqrt{L}-1}$?