24 search results - page 1 / 5 » The Maximum Resource Bin Packing Problem |
FCT
2005
Springer
13 years 10 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
ESA
2004
Springer
13 years 8 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
JAIR
2007
13 years 4 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
ORL
2006
13 years 4 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...