117 search results - page 3 / 24 » Random-order bin packing |
81
Voted
ACTA
2005
14 years 9 months ago
2005
In online square packing, squares of different sizes arrive online and need to be packed into unit squares which are called bins. The goal is to minimize the number of bins used. ...
90
Voted
WAOA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In p...
120
click to vote
MOR
2006
14 years 9 months ago
2006
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
IOR
2008
14 years 9 months ago
2008
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be ex...
DISOPT
2007
14 years 9 months ago
2007
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...