1542 search results - page 4 / 309 » Kernelization of packing problems |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
IPCO
2008
13 years 9 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
ORL
2006
13 years 7 months ago
2006
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...
IOR
2008
13 years 7 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...
EOR
2002
13 years 7 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...