New Algorithms for Bin Packing

Cited in

(78)

A linear time bin-packing algorithm
A 71/60 theorem for bin packing
Online variable-sized bin packing
A lower bound for on-line bin packing
Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
Bin packing can be solved within 1+epsilon in linear time
Improved bounds for harmonic-based bin packing algorithms
Does randomization help in on-line bin packing?
The online graph bandwidth problem
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
Multiple-type, two-dimensional bin packing problems: Applications and algorithms
Joint performance of greedy heuristics for the integer knapsack problem
The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
On extensions of the deterministic online model for bipartite matching and max-sat
The optimal absolute ratio for online bin packing
Batched bin packing
More on batched bin packing
Algorithms for on-line bin-packing problems with cardinality constraints
A tight lower bound for optimal bin packing
Lower bounds for batched bin packing
Homogeneous grouping of non-prime steel products for online auctions: a case study
Online bin packing with cardinality constraints resolved
Efficient 1-space bounded hypercube packing algorithm
On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
Fully dynamic bin packing revisited
A securities selling game
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
A two-dimensional vector packing model for the efficient use of coil cassettes
Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
Approximation and online algorithms for multidimensional bin packing: a survey
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
Improved results for a memory allocation problem
On-line bin packing with restricted repacking
The class constrained bin packing problem with applications to video-on-demand
Online square and cube packing
Approximate strip packing: revisited
Bounds for online bin packing with cardinality constraints
Parallel online algorithms for the bin packing problem
NF-based algorithms for online bin packing with buffer and item size limitation
Online Bin Packing with (1,1) and (2,R) Bins
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
There is no asymptotic PTAS for two-dimensional vector packing
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
Online algorithm for 1-space bounded multi-dimensional bin packing
One-space bounded algorithms for two-dimensional bin packing
Vector bin packing with heterogeneous bins: application to the machine reassignment problem
A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY
Parametric Lower Bound for On-Line Bin-Packing
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
Relaxation techniques applied to some loading problems
Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme
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
On two dimensional packing
Online bin packing with cardinality constraints resolved
Online bin packing problem with buffer and bounded size revisited
Fast approximation methods for online scheduling of outpatient procedure centers
ON THE k-TRUCK SCHEDULING PROBLEM
Adaptive Bin Packing with Overflow
Online bin packing of squares and cubes
A new lower bound for classic online bin packing
Online bin packing of squares and cubes
Lower bounds and algorithms for the 2-dimensional vector packing problem
Tight bounds for online class-constrained packing
A note on online hypercube packing
Tighter bounds for the harmonic bin packing algorithm
A fundamental restriction on fully dynamic maintenance of bin packing
More on online cardinality constrained bin packing with small cardinality bounds
Semi-online models for cardinality constrained bin packing
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Bin packing with rejection revisited
An asymptotic competitive scheme for online bin packing
Online removable square packing
More on online bin packing with two item sizes

This page was built for publication: New Algorithms for Bin Packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3873560)