64 search results - page 1 / 13 » Bin Packing with Fixed Number of Bins Revisited |
96
Voted
SWAT
2010
Springer
14 years 8 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
87
Voted
SIAMCOMP
2008
14 years 10 months ago
2008
Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with...
ALGORITHMICA
2010
14 years 10 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...
101
click to vote
TCS
2010
14 years 8 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
IJCAI
2003
14 years 11 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...