44 search results - page 2 / 9 » Maximizing the Number of Packed Rectangles |
81
Voted
SIU
2002
14 years 11 months ago
2002
In this study we analyze the performance of a Lagrangean relaxation upper bound for the problem of packing the maximum number of rectangles of sizes
207
Voted
WADS
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
INTEGRATION
2007
14 years 11 months ago
2007
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
EOR
2002
14 years 11 months ago
2002
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...
173
click to vote
ICDE
1999
IEEE
16 years 29 days ago
1999
IEEE
In this paper we study the node distribution of an Rtree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are...