A note on the approximability of cutting stock problems


Cutting stock problems and bin packing problems are basically the same problems. They differ essentially on the variability of the input items. In the first, we have a set of items, each item with a given multiplicity; in the second, we have simply a list of items (each of which we may assume to have multiplicity 1). Many approximation algorithms have been… (More)
DOI: 10.1016/j.ejor.2005.09.053