Tighter relaxations for the cutting stoc
β
Christoph Nitsche; Guntram Scheithauer; Johannes Terno
π
Article
π
1999
π
Elsevier Science
π
English
β 134 KB
In the cutting stock problem (CSP) a given order for smaller pieces has to be cut from larger stock material in such a way that the number of stock material needed is minimal. Based on the classical integer linear programming model the common solution technique consists of solving the corresponding