I have an optimization problem and I was wondering where to start from to be able resolve it. I think it can be solved with an NP-complete algorithm but I am not sure where to start from. The problem is the following: There are N types of different colored same-size rectangles that have to be printed. For each type there is a minimum count that has to be printed. Arranging them on a printing plaque costs X amount of money, each piece of paper printed costs Y amount of money. They are all the same size so the maximum amount of rectangles on piece of paper is given as an input, of course you can arrange less than the maximum amount.There could be more pieces printed than the minimum amount required. What is the best way to combine the rectangles having the given input of types and count and prices for arranging and printing so the amount of X + Y to be the lowest?Where should I start with this one, it really sounds like an NP problem where I try all the combinations of pieces of paper and record the best outcome.
Optimization problem where to start, what algorithms to use?
algorithms;optimization;np complete