Nov 13, 2013 · Improved lower bounds for the online bin packing problem with cardinality constraints. Published: 13 November 2013. Volume 29, pages 67–87 ...
Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints. Conference paper. pp 518–530; Cite this conference paper. Download book ...
Abstract. The bin packing problem has been extensively studied and numerous variants have been considered. The k-item bin packing problem is one of the ...
Abstract. The bin packing problem has been extensively studied and numerous variants have been considered. The k-item bin packing problem is one of the ...
In addition to the formulation of the classical bin packing problem, this problem imposes a cardinality constraint that the number of items packed into each bin ...
People also ask
What is bin packing with cardinality constraints?
What is the bin packing problem with constraints?
What are the cardinality constraints?
What is a knapsack problem with cardinality constraints?
In this paper we consider the online k-item bin packing problem. First, we improve the previous lower bound 1.41421 to 1.42764 for k = 2. Moreover, we propose a ...
Our main result, an overall lower bound of 2 on the competitive ratio of any online algorithm for CCBP is proved in Section 4, and improved lower bounds for ...
Additionally, we improve the lower bounds for all values of k, and in particular, prove lower bounds above the best known lower bound on the competitive ratio ...
Our results improve the lower bounds given in Gutin et al. (Discrete Optim 2:71–82, 2005) for some special cases of the batched bin packing problem.
In this paper we provide improved lower bounds on the asymptotic competitive ratio of arbitrary online algorithms for k = 5 , 7 , 8 , 9 , 10 , 11 . The values ...