On the online bin packing problem
From MaRDI portal
Publication:3455545
DOI10.1145/585265.585269zbMath1326.68337OpenAlexW2078659331WikidataQ105584196 ScholiaQ105584196MaRDI QIDQ3455545
Publication date: 7 December 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/585265.585269
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (81)
Online bin covering: expectations vs. guarantees ⋮ Online Bin Packing with Advice of Small Size ⋮ 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 ⋮ Online Colored Bin Packing ⋮ Dynamic bin packing of unit fractions items ⋮ Bin packing with rejection revisited ⋮ Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic ⋮ Maximizing data locality in distributed systems ⋮ Black and White Bin Packing Revisited ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Batched bin packing revisited ⋮ Randomized competitive analysis for two server problems ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Dynamic bin packing with unit fraction items revisited ⋮ Bin packing with ``largest in bottom constraint: tighter bounds and generalizations ⋮ Selfish bin packing with cardinality constraints ⋮ Online bin packing with cardinality constraints resolved ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ An asymptotic competitive scheme for online bin packing ⋮ A note on online hypercube packing ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Online bin packing with resource augmentation ⋮ Unnamed Item ⋮ Bin packing with general cost structures ⋮ Colored bin packing: online algorithms and lower bounds ⋮ Tight bounds for NF-based bounded-space online bin packing algorithms ⋮ Unnamed Item ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ On-line bin packing with restricted repacking ⋮ New lower bounds for certain classes of bin packing algorithms ⋮ Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers ⋮ On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis ⋮ Bin covering with cardinality constraints ⋮ Competitive clustering of stochastic communication patterns on a ring ⋮ Randomized Competitive Analysis for Two-Server Problems ⋮ Online square packing with gravity ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Fully-Dynamic Bin Packing with Little Repacking ⋮ Best fit bin packing with random order revisited ⋮ 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 ⋮ On the on-line maintenance scheduling problem ⋮ Online bin packing problem with buffer and bounded size revisited ⋮ More on online bin packing with two item sizes ⋮ Online bin packing with arbitrary release times ⋮ 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 ⋮ A new upper bound for the online square packing problem in a strip ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ Two-dimensional online bin packing with rotation ⋮ 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 ⋮ 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 ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ Variable sized online interval coloring with bandwidth ⋮ On online bin packing with LIB constraints ⋮ Techniques and results on approximation algorithms for packing circles ⋮ Online square and cube packing ⋮ Online results for black and white bin packing ⋮ NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation ⋮ Online Bin Covering: Expectations vs. Guarantees ⋮ Online Bin Packing with (1,1) and (2,R) Bins ⋮ 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 ⋮ Online bin packing with \((1,1)\) and \((2,R)\) bins ⋮ NF-based algorithms for online bin packing with buffer and bounded item size ⋮ Online bin packing with advice
This page was built for publication: On the online bin packing problem
