A simple on-line bin-packing algorithm
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Online algorithm for 1-space bounded multi-dimensional bin packing
- Bin packing with rejection revisited
- Max-min and 1-bounded space algorithms for the bin packing problem
- Analytical Problem Solving Based on Causal, Correlational and Deductive Models
- One-space bounded algorithms for two-dimensional bin packing
- Renting servers in the cloud: the case of equal duration jobs
- Class constrained bin packing revisited
- A tight lower bound for the online bounded space hypercube bin packing problem
- Online colored bin packing
- Comparing online algorithms for bin packing problems
- A tight lower bound for optimal bin packing
- Bounds for online bin packing with cardinality constraints
- Online bin packing problem with buffer and bounded size revisited
- On the effectiveness of the harmonic shelf algorithm for on-line strip packing
- Near-optimal algorithms for stochastic online bin packing
- Bin packing problem with scenarios
- On-line bin packing with restricted repacking
- A note on a variant of the online open end bin packing problem
- A 4-space bounded approximation algorithm for online bin packing problem
- Online Bin Covering: Expectations vs. Guarantees
- Online Bin Packing with (1,1) and (2,R) Bins
- Efficient 1-space bounded hypercube packing algorithm
- More on online bin packing with two item sizes
- Online square and cube packing
- Variable sized online interval coloring with bandwidth
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Quality of equilibria for selfish bin packing with cost sharing variants
- Sparse, continuous policy representations for uniform online bin packing via regression of interpolants
- Online results for black and white bin packing
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Average case analysis of bounded space bin packing algorithms
- Parametric packing of selfish items and the subset sum algorithm
- Batched bin packing revisited
- Semi-on-line bin packing: a short overview and a new lower bound
- Colored bin packing: online algorithms and lower bounds
- Several methods of analysis for cardinality constrained bin packing
- Several methods of analysis for cardinality constrained bin packing
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- Acceleration strategies for explicit finite element analysis of metal powder-based additive manufacturing processes using graphical processing units
- Selfish bin packing
- Bin packing with general cost structures
- The class constrained bin packing problem with applications to video-on-demand
- Deep performance analysis of refined harmonic bin packing algorithm
- A new and improved algorithm for online bin packing
- A fundamental restriction on fully dynamic maintenance of bin packing
- Best fit bin packing with random order revisited
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- Best fit bin packing with random order revisited
- Black and White Bin Packing Revisited
- A new upper bound for the online square packing problem in a strip
- Two-dimensional online bin packing with rotation
- Tighter bounds for the harmonic bin packing algorithm
- Assigning service requests in voice-over-internet gateway multiprocessors
- Models for video-on-demand scheduling with costs
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
- Shelf algorithms for on-line strip packing
- The optimal absolute ratio for online bin packing
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
- Online bin packing of squares and cubes
- Repacking helps in bounded space on-line bin-packing
- Average-case analysis of the smart next fit algorithm
- Interior-point-based online stochastic bin packing
- Lower bound for 3-batched bin packing
- More on batched bin packing
- Online bin covering: expectations vs. guarantees
- An on-line algorithm for variable-sized bin packing
- Streaming algorithms for bin packing and vector scheduling
- Locality-preserving allocations problems and coloured bin packing
- Online bin packing with \((1,1)\) and \((2,R)\) bins
- Linear time-approximation algorithms for bin packing
- Scheduling jobs on grid processors
- Bin packing with controllable item sizes
- Average-case analysis of cutting and packing in two dimensions
- Bounds for online bounded space hypercube packing
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
- Two-dimensional on-line bin packing problem with rotatable items.
- The variable-width strip packing problem
- Scheduling appointments online: the power of deferred decision-making
- A probabilistic analysis of the next fit decreasing bin packing heuristic
- Approximation and online algorithms for multidimensional bin packing: a survey
- Dynamic multi-dimensional bin packing
- Online variable-sized bin packing
- Improved bounds for harmonic-based bin packing algorithms
- An improved lower bound for on-line bin packing algorithms
- A new lower bound for classic online bin packing
- Bin covering with cardinality constraints
- Semi-online models for cardinality constrained bin packing
- Online bin packing with cardinality constraints resolved
- Tight results for next fit and worst fit with resource augmentation
- Packing resizable items with application to video delivery over wireless networks
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- On-line bin packing ? A restricted survey
- An on-line algorithm for multidimensional bin packing
- Two-dimensional packing with conflicts
- Resource augmented semi-online bounded space bin packing
- A robust APTAS for the classical bin packing problem
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
- Optimal on-line algorithms for variable-sized bin covering
- A note on online hypercube packing
This page was built for publication: A simple on-line bin-packing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766848)
