On the online bin packing problem
From MaRDI portal
Publication:3455545
DOI10.1145/585265.585269zbMATH Open1326.68337OpenAlexW2078659331WikidataQ105584196 ScholiaQ105584196MaRDI QIDQ3455545FDOQ3455545
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1756012
- On-line bin packing ? A restricted survey
- On-line bin packing in linear time
- Online bin packing: old algorithms and new results
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem
- scientific article; zbMATH DE number 2081032
- Online Bin Packing with Cardinality Constraints
- Algorithms – ESA 2005
- On online bin packing with LIB constraints
- On-line bin packing with restricted repacking
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cited In (95)
- Algorithms – ESA 2005
- Batched bin packing revisited
- Title not available (Why is that?)
- Online bin packing with advice
- Beating the harmonic lower bound for online bin packing
- Semi-on-line bin packing: a short overview and a new lower bound
- Colored bin packing: online algorithms and lower bounds
- Selfish bin packing with cardinality constraints
- New lower bounds for certain classes of bin packing algorithms
- Bin packing with general cost structures
- A new and improved algorithm for online bin packing
- The class constrained bin packing problem with applications to video-on-demand
- Efficient Approximations for the Online Dispersion Problem
- Online bin packing with advice of small size
- Best fit bin packing with random order revisited
- Best fit bin packing with random order revisited
- Two-dimensional online bin packing with rotation
- Maximizing data locality in distributed systems
- The optimal absolute ratio for online bin packing
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
- NF-based algorithms for online bin packing with buffer and bounded item size
- Online algorithms with advice for the dual bin packing problem
- Online bin covering: expectations vs. guarantees
- Bin packing with controllable item sizes
- Randomized Competitive Analysis for Two-Server Problems
- On dynamic bin packing: An improved lower bound and resource augmentation analysis
- Approximation and online algorithms for multidimensional bin packing: a survey
- A new lower bound for classic online bin packing
- Online variable-sized bin packing
- Bin covering with cardinality constraints
- On-line bin packing ? A restricted survey
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- Online algorithms for a dual version of bin packing
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Resource augmented semi-online bounded space bin packing
- A robust APTAS for the classical bin packing problem
- Improved lower bounds for semi-online bin packing problems
- A note on online hypercube packing
- An asymptotic competitive scheme for online bin packing
- Fast approximation methods for online scheduling of outpatient procedure centers
- Bin packing problems with rejection penalties and their dual problems
- Online square packing with gravity
- Fully-dynamic bin packing with little repacking
- On online bin packing with LIB constraints
- Dynamic bin packing with unit fraction items revisited
- Title not available (Why is that?)
- Online bin packing with resource augmentation
- Online algorithm for 1-space bounded multi-dimensional bin packing
- Fully dynamic bin packing revisited
- Online bin packing with delay and holding costs
- Online strip packing with polynomial migration
- Bin packing with rejection revisited
- Improved lower bounds for the online bin packing problem with cardinality constraints
- One-space bounded algorithms for two-dimensional bin packing
- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
- Class constrained bin packing revisited
- Comparing online algorithms for bin packing problems
- Randomized competitive analysis for two server problems
- Dynamic bin packing of unit fractions items
- Bounds for online bin packing with cardinality constraints
- On-line bin packing with restricted repacking
- Online bin packing problem with buffer and bounded size revisited
- Online Bin Covering: Expectations vs. Guarantees
- Title not available (Why is that?)
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- Online square and cube packing
- More on online bin packing with two item sizes
- Variable sized online interval coloring with bandwidth
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Online results for black and white bin packing
- Competitive clustering of stochastic communication patterns on a ring
- Black and White Bin Packing Revisited
- Tighter bounds for the harmonic bin packing algorithm
- On the on-line maintenance scheduling problem
- A new upper bound for the online square packing problem in a strip
- Online bin packing of squares and cubes
- More on batched bin packing
- On the on-line number of snacks problem
- Online bin packing with \((1,1)\) and \((2,R)\) bins
- Heuristic algorithms based on column generation for an online product shipping problem
- Online bin packing with cardinality constraints resolved
- Online bin packing of squares and cubes
- Approximate strip packing: revisited
- Online bin packing with cardinality constraints resolved
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Online bin packing with arbitrary release times
- NF-based algorithms for online bin packing with buffer and item size limitation
- A tight lower bound for the online bounded space hypercube bin packing problem
- Online colored bin packing
- Techniques and results on approximation algorithms for packing circles
- Tight bounds for NF-based bounded-space online bin packing algorithms
- Online Bin Packing with (1,1) and (2,R) Bins
- Efficient 1-space bounded hypercube packing algorithm
This page was built for publication: On the online bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455545)
