8 search results - page 1 / 2 » A Fast Asymptotic Approximation Scheme for Bin Packing with ... |
124
click to vote
IPL
2008
15 years 1 months ago
2008
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
113
click to vote
ALGORITHMICA
2010
15 years 1 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...
97
Voted
EOR
2008
15 years 1 months ago
2008
137
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...