106 search results - page 1 / 22 » Almost Square Packing |
184
Voted
CPAIOR
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
103
Voted
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
104
click to vote
ACTA
2008
15 years 8 days ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
118
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
100
click to vote
ACTA
2005
15 years 1 days 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. ...