A simple on-line bin-packing algorithm
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Bin packing with controllable item sizes
- On-line grid-packing with a single active grid
- A robust APTAS for the classical bin packing problem
- Bidimensional packing by bilinear programming
- Variable sized online interval coloring with bandwidth
- On lazy bin covering and packing problems
- A probabilistic analysis of the next fit decreasing bin packing heuristic
- Online variable-sized bin packing
- Average-case analysis of the smart next fit algorithm
- Improved bounds for harmonic-based bin packing algorithms
- An improved lower bound for on-line bin packing algorithms
- Repacking helps in bounded space on-line bin-packing
- 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
- Linear time-approximation algorithms for bin packing
- Deep performance analysis of refined harmonic bin packing algorithm
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
- Colored bin packing: online algorithms and lower bounds
- The optimal absolute ratio for online bin packing
- Lower bound for 3-batched bin packing
- Batched bin packing
- More on batched bin packing
- Average-case analysis of the modified harmonic algorithm
- Two-dimensional on-line bin packing problem with rotatable items.
- Assigning service requests in voice-over-internet gateway multiprocessors
- Algorithms for on-line bin-packing problems with cardinality constraints
- A tight lower bound for optimal bin packing
- Best fit bin packing with random order revisited
- A new upper bound for the online square packing problem in a strip
- More on ordered open end bin packing
- The variable-width strip packing problem
- Open-end bin packing: new and old analysis approaches
- Online bin packing with cardinality constraints resolved
- Efficient 1-space bounded hypercube packing algorithm
- Quality of equilibria for selfish bin packing with cost sharing variants
- On bin packing with clustering and bin packing with delays
- Fully dynamic bin packing revisited
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Acceleration strategies for explicit finite element analysis of metal powder-based additive manufacturing processes using graphical processing units
- Online results for black and white bin packing
- Locality-preserving allocations problems and coloured bin packing
- Online bin packing with \((1,1)\) and \((2,R)\) bins
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Batched bin packing revisited
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bin packing problem with scenarios
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing
- Online bin packing with resource augmentation
- Bin packing with general cost structures
- Comparing online algorithms for bin packing problems
- On-line bin packing with restricted repacking
- Bin covering with cardinality constraints
- Bounds for online bounded space hypercube packing
- Average case analysis of bounded space bin packing algorithms
- The class constrained bin packing problem with applications to video-on-demand
- Online square and cube packing
- Parametric packing of selfish items and the subset sum algorithm
- Approximate strip packing: revisited
- Bounds for online bin packing with cardinality constraints
- A note on a variant of the online open end bin packing problem
- Parallel online algorithms for the bin packing problem
- Models for video-on-demand scheduling with costs
- Online Bin Covering: Expectations vs. Guarantees
- Online Bin Packing with (1,1) and (2,R) Bins
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
- Shelf algorithms for on-line strip packing
- Online bin covering: expectations vs. guarantees
- Online algorithm for 1-space bounded multi-dimensional bin packing
- Semi-on-line bin packing: a short overview and a new lower bound
- One-space bounded algorithms for two-dimensional bin packing
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
- Sparse, continuous policy representations for uniform online bin packing via regression of interpolants
- Online colored bin packing
- Black and White Bin Packing Revisited
- Selfish Bin Packing
- On online bin packing with LIB constraints
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- On-line bin packing ? A restricted survey
- Fully-dynamic bin packing with little repacking
- A new and improved algorithm for online bin packing
- A tight lower bound for the online bounded space hypercube bin packing problem
- Best fit bin packing with random order revisited
- Online bin packing with cardinality constraints resolved
- Online bin packing problem with buffer and bounded size revisited
- Interior-point-based online stochastic bin packing
- Selfish bin packing
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
- An on-line algorithm for variable-sized bin packing
- Average-case analysis of cutting and packing in two dimensions
- Online bin packing of squares and cubes
- A new lower bound for classic online bin packing
- Several methods of analysis for cardinality constrained bin packing
- Streaming algorithms for bin packing and vector scheduling
- Online bin packing of squares and cubes
- Several methods of analysis for cardinality constrained bin packing
- Analytical Problem Solving Based on Causal, Correlational and Deductive Models
- A 4-space bounded approximation algorithm for online bin packing problem
- Dynamic multi-dimensional bin packing
- Scheduling appointments online: the power of deferred decision-making
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)
