New Algorithms for Bin Packing
From MaRDI portal
Publication:3873560
DOI10.1145/322186.322187zbMath0434.68053MaRDI QIDQ3873560
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items
Lower bounds for batched bin packing, A 71/60 theorem for bin packing, Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, There is no asymptotic PTAS for two-dimensional vector packing, Algorithms for on-line bin-packing problems with cardinality constraints, Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem, Joint performance of greedy heuristics for the integer knapsack problem, Approximate strip packing: revisited, Bounds for online bin packing with cardinality constraints, The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints, On two dimensional packing, Bin packing with rejection revisited, Parametric Lower Bound for On-Line Bin-Packing, A two-dimensional vector packing model for the efficient use of coil cassettes, Vector bin packing with heterogeneous bins: application to the machine reassignment problem, Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing, Homogeneous grouping of non-prime steel products for online auctions: a case study, Online variable-sized bin packing, Approximation and online algorithms for multidimensional bin packing: a survey, Tight bounds for online class-constrained packing, A tight lower bound for optimal bin packing, On-line bin packing ? A restricted survey, Online bin packing with cardinality constraints resolved, A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY, An asymptotic competitive scheme for online bin packing, A note on online hypercube packing, Drawer algorithms for 1-space bounded multidimensional hyperbox packing, A lower bound for on-line bin packing, Relaxation techniques applied to some loading problems, Probabilistic analysis for simple one- and two-dimensional bin packing algorithms, Improved results for a memory allocation problem, Unnamed Item, Efficient 1-space bounded hypercube packing algorithm, Partitioned EDF scheduling for multiprocessors using a \(C=D\) task splitting scheme, On-line bin packing with restricted repacking, Parallel online algorithms for the bin packing problem, Bin packing can be solved within 1+epsilon in linear time, Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers, On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis, Online removable square packing, ON THE k-TRUCK SCHEDULING PROBLEM, Improved bounds for harmonic-based bin packing algorithms, Fully-Dynamic Bin Packing with Little Repacking, Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing, A fundamental restriction on fully dynamic maintenance of bin packing, Online bin packing of squares and cubes, On extensions of the deterministic online model for bipartite matching and max-sat, The optimal absolute ratio for online bin packing, Online bin packing problem with buffer and bounded size revisited, More on online bin packing with two item sizes, Does randomization help in on-line bin packing?, The online graph bandwidth problem, The class constrained bin packing problem with applications to video-on-demand, A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case, Online bin packing of squares and cubes, Lower bounds and algorithms for the 2-dimensional vector packing problem, Batched bin packing, Lower bounds for several online variants of bin packing, More on batched bin packing, Fully dynamic bin packing revisited, ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING, A securities selling game, A new lower bound for classic online bin packing, Unnamed Item, Online algorithms for 1-space bounded 2-dimensional bin packing and square packing, Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps, Online square and cube packing, A linear time bin-packing algorithm, NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation, Online Bin Packing with (1,1) and (2,R) Bins, Adaptive Bin Packing with Overflow, A tight lower bound for the online bounded space hypercube bin packing problem, 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
