Online Colored Bin Packing

@article{Bhm2014OnlineCB,
  title={Online Colored Bin Packing},
  author={Martin B{\"o}hm and J. Sgall and P. Vesel{\'y}},
  journal={ArXiv},
  year={2014},
  volume={abs/1404.5548}
}
In the Colored Bin Packing problem a sequence of items of sizes up to \(1\) arrives to be packed into bins of unit capacity. Each item has one of \(c\ge 2\) colors and an additional constraint is that we cannot pack two items of the same color next to each other in the same bin. The objective is to minimize the number of bins. 
Bin Packing with Multiple Colors
A Two-Pass Algorithm for Unordered Colored Bin Packing
Colored Bin Packing: Online Algorithms and Lower Bounds
VNS matheuristic for a bin packing problem with a color constraint
Black and White Bin Packing Revisited
Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation
Bin packing with directed stackability conflicts
Online packing of arbitrary sized items into designated and multipurpose bins
Offline black and white bin packing
...
1
2
...

References

SHOWING 1-10 OF 24 REFERENCES
Bin packing can be solved within 1 + ε in linear time
Online bin packing with cardinality constraints revisited
Algorithms for on-line bin-packing problems with cardinality constraints
Online Results for Black and White Bin Packing
Online Bin Packing with Cardinality Constraints
  • L. Epstein
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 2006
Black and White Bin Packing
Colorful Bin Packing
Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints
First Fit bin packing: A tight analysis
On the worst-case performance of the NkF bin-packing heuristic
...
1
2
3
...