On the online bin packing problem

From MaRDI portal
Publication:3455545

DOI10.1145/585265.585269zbMath1326.68337OpenAlexW2078659331WikidataQ105584196 ScholiaQ105584196MaRDI QIDQ3455545

Steven S. Seiden

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




Related Items (81)

Online bin covering: expectations vs. guaranteesOnline Bin Packing with Advice of Small SizeSemi-on-line bin packing: a short overview and a new lower boundApproximate strip packing: revisitedBounds for online bin packing with cardinality constraintsThe tight asymptotic approximation ratio of first fit for bin packing with cardinality constraintsOnline Colored Bin PackingDynamic bin packing of unit fractions itemsBin packing with rejection revisitedLogistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristicMaximizing data locality in distributed systemsBlack and White Bin Packing RevisitedOnline algorithms for 1-space bounded multidimensional bin packing and hypercube packingBatched bin packing revisitedRandomized competitive analysis for two server problemsApproximation and online algorithms for multidimensional bin packing: a surveyDynamic bin packing with unit fraction items revisitedBin packing with ``largest in bottom constraint: tighter bounds and generalizationsSelfish bin packing with cardinality constraintsOnline bin packing with cardinality constraints resolvedHeuristic algorithms based on column generation for an online product shipping problemAn asymptotic competitive scheme for online bin packingA note on online hypercube packingDrawer algorithms for 1-space bounded multidimensional hyperbox packingOnline bin packing with resource augmentationUnnamed ItemBin packing with general cost structuresColored bin packing: online algorithms and lower boundsTight bounds for NF-based bounded-space online bin packing algorithmsUnnamed ItemEfficient 1-space bounded hypercube packing algorithmOn-line bin packing with restricted repackingNew lower bounds for certain classes of bin packing algorithmsFast Approximation Methods for Online Scheduling of Outpatient Procedure CentersOn online algorithms for bin, strip, and box packing, and their worst-case and average-case analysisBin covering with cardinality constraintsCompetitive clustering of stochastic communication patterns on a ringRandomized Competitive Analysis for Two-Server ProblemsOnline square packing with gravityEfficient Approximations for the Online Dispersion ProblemFully-Dynamic Bin Packing with Little RepackingBest fit bin packing with random order revisitedOnline Algorithm for 1-Space Bounded Multi-dimensional Bin PackingOnline bin packing of squares and cubesThe optimal absolute ratio for online bin packingOn the on-line maintenance scheduling problemOnline bin packing problem with buffer and bounded size revisitedMore on online bin packing with two item sizesOnline bin packing with arbitrary release timesThe class constrained bin packing problem with applications to video-on-demandResource augmented semi-online bounded space bin packingOnline bin packing of squares and cubesA new upper bound for the online square packing problem in a stripBin packing problems with rejection penalties and their dual problemsTwo-dimensional online bin packing with rotationClass constrained bin packing revisitedLower bounds for several online variants of bin packingMore on batched bin packingFully dynamic bin packing revisitedONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKINGBin packing with controllable item sizesA new lower bound for classic online bin packingUnnamed ItemOnline algorithms for 1-space bounded 2-dimensional bin packing and square packingA robust APTAS for the classical bin packing problemImproved lower bounds for semi-online bin packing problemsOn dynamic bin packing: An improved lower bound and resource augmentation analysisBest Fit Bin Packing with Random Order RevisitedVariable sized online interval coloring with bandwidthOn online bin packing with LIB constraintsTechniques and results on approximation algorithms for packing circlesOnline square and cube packingOnline results for black and white bin packingNF-Based Algorithms for Online Bin Packing with Buffer and Item Size LimitationOnline Bin Covering: Expectations vs. GuaranteesOnline Bin Packing with (1,1) and (2,R) BinsA tight lower bound for the online bounded space hypercube bin packing problemImproved lower bounds for the online bin packing problem with cardinality constraintsOnline bin packing with \((1,1)\) and \((2,R)\) binsNF-based algorithms for online bin packing with buffer and bounded item sizeOnline bin packing with advice




This page was built for publication: On the online bin packing problem