Fast algorithms for bin packing

Cites work

scientific article; zbMATH DE number 3557207 (Why is no real title available?)
scientific article; zbMATH DE number 3566230 (Why is no real title available?)
scientific article; zbMATH DE number 3571502 (Why is no real title available?)
scientific article; zbMATH DE number 3593565 (Why is no real title available?)
scientific article; zbMATH DE number 3423800 (Why is no real title available?)
A Note on the Efficiency of Hashing Functions
Binary Search Trees of Bounded Balance

Cited in

(only showing first 100 items - show all)

Order acceptance for motorail transportation with uncertain parameters
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
Best \(k\)-fit bin packing
Online results for black and white bin packing
A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
Average case analysis of bounded space bin packing algorithms
Approximation scheduling algorithms: a survey
Comparing the costs of any fit algorithms for bin packing
Improved results for a memory allocation problem
Algorithmic analysis of priority-based bin packing
Several methods of analysis for cardinality constrained bin packing
Several methods of analysis for cardinality constrained bin packing
New lower bounds for certain classes of bin packing algorithms
Average-case analyses of first fit and random fit bin packing
On-line scheduling of parallel jobs with runtime restrictions
Bin packing with general cost structures
Design of private backbone networks. II: Time varying grouped traffic
A linear time bin-packing algorithm
The class constrained bin packing problem with applications to video-on-demand
Tight bounds for online class-constrained packing
A new and improved algorithm for online bin packing
Best fit bin packing with random order revisited
A survey on combinatorial optimization in dynamic environments
Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing
Best fit bin packing with random order revisited
Analysis of a first-fit algorithm for the capacitated unit covering problem
Online variable-sized bin packing with conflicts
Two-dimensional online bin packing with rotation
Tighter bounds for the harmonic bin packing algorithm
Assigning service requests in voice-over-internet gateway multiprocessors
Bin packing can be solved within 1+epsilon in linear time
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
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
Heuristic methods and applications: A categorized survey
NF-based algorithms for online bin packing with buffer and bounded item size
More on batched bin packing
Worst-case analysis of the subset sum algorithm for bin packing.
Performance of the LPT algorithm in multiprocessor scheduling
Adaptive Bin Packing with Overflow
Streaming algorithms for bin packing and vector scheduling
Online bin packing with \((1,1)\) and \((2,R)\) bins
Some simplified NP-complete graph problems
The partitioned dynamic-priority scheduling of sporadic task systems
A 5/4 linear time bin packing algorithm
Scheduling jobs on grid processors
Bin packing with controllable item sizes
On the absolute approximation ratio for first fit and related results
A storage-size selection problem
Convergence of optimal stochastic bin packing
Bounds for online bounded space hypercube packing
A bin packing approach to solve the aircraft maintenance task allocation problem
An algorithm for a class of loading problems
The cutting stock problem applied to the hardening process in an automotive spring factory
Scheduling appointments online: the power of deferred decision-making
Offline black and white bin packing
Efficient heuristics for robot acquisition planning for a CIM system
Online variable-sized bin packing
The relative worst-order ratio applied to paging
Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
A class of simple stochastic online bin packing algorithms
Optimal energy-efficient placement of virtual machines with divisible sizes
A new lower bound for classic online bin packing
Priority-based bin packing with subset constraints
Tight results for next fit and worst fit with resource augmentation
Parametric on-line algorithms for packing rectangles and boxes.
On-line bin packing ? A restricted survey
A grouping genetic algorithm with controlled gene transmission for the bin packing problem
Resource constrained scheduling as generalized bin packing
An on-line algorithm for multidimensional bin packing
A hybrid genetic/optimization algorithm for a task allocation problem
Exact distributional analysis of online algorithms with lookahead
Resource augmented semi-online bounded space bin packing
NP-Complete operations research problems and approximation algorithms
Online bin packing of squares and cubes
Homogeneous grouping of non-prime steel products for online auctions: a case study
An asymptotic competitive scheme for online bin packing
Online bin packing with cardinality constraints resolved
An effective structured approach to finding optimal partitions of networks
Two- and three-dimensional parametric packing
On capacitated covering with unit balls
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
Relaxation techniques applied to some loading problems
Online bin packing of fragile objects with application in cellular networks
Fast approximation methods for online scheduling of outpatient procedure centers
Parallel online algorithms for the bin packing problem
The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
Algorithms for the two dimensional bin packing problem with partial conflicts
Relative Worst-Order Analysis: A Survey
An AFPTAS for variable sized bin packing with general activation costs
Fully-dynamic bin packing with little repacking
Heuristics for laying out information graphs
Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
NF-based algorithms for online bin packing with buffer and item size limitation
On online bin packing with LIB constraints
Open-end bin packing: new and old analysis approaches
Bridging gap between standard and differential polynomial approximation: The case of bin-packing
Online algorithms for page replication in rings
Online bin packing with resource augmentation

This page was built for publication: Fast algorithms for bin packing

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