This paper deals with the Two-Dimensional Cutting Stock Problem with Setup Cost (2CSP-S). This problem is composed of three optimization sub-problems: a 2-D Bin Packing (2BP) problem (to place images on patterns), a Linear Programming (LP) problem (to find for each pattern the number of stock sheets to be printed) and a combinatorial problem (to find the… (More)