4 search results - page 1 / 1 » An APTAS for Generalized Cost Variable-Sized Bin Packing |
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...
113
click to vote
WAOA
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
103
click to vote
ICS
2009
Tsinghua U.
14 years 7 months ago
2009
Tsinghua U.
Data de-duplication has become a commodity component in dataintensive systems and it is required that these systems provide high reliability comparable to others. Unfortunately, b...