Ufa Mathematical Journal
    Volume 3, Number 4, pp. 56-61

    Combinatorial complexity of compact 1-dimensional Cutting Stock Problem

    Kartak V.M., Kartak V.V.

    Download PDF
    Article on MathNet


    The classical 1-dimensional Cutting Stock Problem (1CSP) is conыidered. It is known that 1CSP is at least NP-hard. Some exact algorithms for solution this problem are known. In the present paper we describe combinatorial complexity of 1CSP for the compact instances and find the most hard cases.