An improved lower bound for on-line bin packing algorithms

Related Items (72)

Lower bounds for batched bin packing ⋮ Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms ⋮ Shelf algorithms for on-line strip packing ⋮ Algorithms for on-line bin-packing problems with cardinality constraints ⋮ Semi-on-line bin packing: a short overview and a new lower bound ⋮ Approximate strip packing: revisited ⋮ Bounds for online bin packing with cardinality constraints ⋮ The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints ⋮ Dynamic bin packing of unit fractions items ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Bin packing with rejection revisited ⋮ Online Square Packing ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Worst-case analysis of fast heuristics for packing squares into a square ⋮ Batched bin packing revisited ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Open-end bin packing: new and old analysis approaches ⋮ Dynamic bin packing with unit fraction items revisited ⋮ Bin packing with ``largest in bottom constraint: tighter bounds and generalizations ⋮ On-line bin packing ? A restricted survey ⋮ Online bin packing with cardinality constraints resolved ⋮ A note on online hypercube packing ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Online bin packing with resource augmentation ⋮ Improved results for a memory allocation problem ⋮ Tight bounds for NF-based bounded-space online bin packing algorithms ⋮ Unnamed Item ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ New lower bounds for certain classes of bin packing algorithms ⋮ Parallel online algorithms for the bin packing problem ⋮ On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis ⋮ Online square packing with gravity ⋮ Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing ⋮ Online bin packing of squares and cubes ⋮ The optimal absolute ratio for online bin packing ⋮ More on online bin packing with two item sizes ⋮ Online bin packing with arbitrary release times ⋮ An on-line algorithm for multidimensional bin packing ⋮ The class constrained bin packing problem with applications to video-on-demand ⋮ Resource augmented semi-online bounded space bin packing ⋮ Online bin packing of squares and cubes ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ Two-dimensional online bin packing with rotation ⋮ Batched bin packing ⋮ On-line algorithms for packing rectangles into several strips ⋮ Class constrained bin packing revisited ⋮ Lower bounds for several online variants of bin packing ⋮ More on batched bin packing ⋮ Fully dynamic bin packing revisited ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ Bin packing with controllable item sizes ⋮ A new lower bound for classic online bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ On-line grid-packing with a single active grid ⋮ Unnamed Item ⋮ Online algorithms for 1-space bounded 2-dimensional bin packing and square packing ⋮ A robust APTAS for the classical bin packing problem ⋮ Improved lower bounds for semi-online bin packing problems ⋮ On dynamic bin packing: An improved lower bound and resource augmentation analysis ⋮ Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing ⋮ More on ordered open end bin packing ⋮ A lower bound for online rectangle packing ⋮ Online square and cube packing ⋮ Two-dimensional on-line bin packing problem with rotatable items. ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Online results for black and white bin packing ⋮ Online Bin Packing with (1,1) and (2,R) Bins ⋮ Adaptive Bin Packing with Overflow ⋮ A tight lower bound for the online bounded space hypercube bin packing problem ⋮ Improved lower bounds for the online bin packing problem with cardinality constraints ⋮ Locality-preserving allocations problems and coloured bin packing ⋮ Online bin packing with \((1,1)\) and \((2,R)\) bins

Cites Work

This page was built for publication: An improved lower bound for on-line bin packing algorithms