4 search results - page 1 / 1 » Online Bin Packing with Cardinality Constraints |
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
WAOA
2007
Springer
13 years 10 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
TCS
2008
13 years 4 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...