Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
نویسندگان
چکیده
منابع مشابه
Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for unif...
متن کاملLower bounds for several online variants of bin packing
We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.
متن کاملOn online bin packing with LIB constraints
In many applications of packing, the location of small items below large items, inside the packed boxes, is forbidden. We consider a variant of the classic online one dimensional bin packing, in which items allocated to each bin are packed there in the order of arrival, satisfying the condition above. This variant is called online bin packing problem with LIB (Larger Item in the Bottom) constra...
متن کاملNew Classes of Lower Bounds for Bin Packing Problems
The bin packing problem is one of the classical NP-hard optimization problems. Even though there are many excellent theoretical results, including polynomial approximation schemes, there is still a lack of methods that are able to solve practical instances optimally. In this paper, we present a fast and simple generic approach for obtaining new lower bounds, based on dual feasible functions. Wo...
متن کاملNew classes of fast lower bounds for bin packing problems
The bin packing problem is one of the classical NP-hard optimization problems. In this paper, we present a simple generic approach for obtaining new fast lower bounds, based on dual feasible functions. Worst-case analysis as well as computational results show that one of our classes clearly outperforms the previous best “economical” lower bound for the bin packing problem by Martello and Toth, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2005
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2006001