Sciweavers

106 search results - page 1 / 22
» An Improved Algorithm for Optimal Bin Packing
Sort
View
IOR
2008
102views more  IOR 2008»
13 years 4 months ago
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
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...
Alberto Ceselli, Giovanni Righini
IJCAI
2003
13 years 6 months ago
An Improved Algorithm for Optimal Bin Packing
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
Richard E. Korf
APPROX
2009
Springer
177views Algorithms» more  APPROX 2009»
13 years 11 months ago
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
Rolf Harren, Rob van Stee
COCOON
2006
Springer
13 years 8 months ago
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
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...
Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yu...
ISAAC
2010
Springer
221views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
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...
Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin...