117 search results - page 5 / 24 » Random-order bin packing |
JAIR
2007
14 years 11 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be...
106
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
114
click to vote
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
ALGORITHMICA
2010
14 years 11 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...