## Bounds and Heuristic Algorithms for the Bin Packing Problem with Minimum Color Fragmentation

In this paper, we consider a recently introduced packing problem in which a given set of weighted items with colors has to be packed into a set of identical bins, while respecting capacity constraints and minimizing the total number of times that colors appear in the bins. We review exact methods from the literature and … Read more