Sciweavers

15 search results - page 2 / 3
» Dynamic Bin Packing of Unit Fractions Items
Sort
View
DISOPT
2007
114views more  DISOPT 2007»
13 years 5 months ago
Bounds for online bounded space hypercube packing
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed withi...
Leah Epstein, Rob van Stee
EOR
2002
105views more  EOR 2002»
13 years 5 months ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
13 years 7 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
13 years 5 months ago
Bin Packing with Rejection Revisited
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...
Leah Epstein
RANDOM
1998
Springer
13 years 9 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev