Tighter bounds for the harmonic bin packing algorithm
From MaRDI portal
Cites work
- A bin packing approach to solve the aircraft maintenance task allocation problem
- A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays
- A generalized bin packing problem for parcel delivery in last-mile logistics
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- A lower bound for on-line bin packing
- A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation
- A new and improved algorithm for online bin packing
- A new lower bound for classic online bin packing
- A note on a variant of the online open end bin packing problem
- A robust AFPTAS for online bin packing with polynomial migration
- A robust APTAS for the classical bin packing problem
- A simple on-line bin-packing algorithm
- Adaptive Bin Packing with Overflow
- Algorithms for on-line bin-packing problems with cardinality constraints
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem
- An improved lower bound for on-line bin packing algorithms
- An on-line algorithm for variable-sized bin packing
- An optimal online algorithm for bounded space variable-sized bin packing
- Beating the harmonic lower bound for online bin packing
- Best k-fit bin packing
- Bin packing can be solved within 1+epsilon in linear time
- Bin packing problem with scenarios
- Bounded space on-line bin packing: Best is better than first
- Bounds for online bin packing with cardinality constraints
- Fast algorithms for bin packing
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Fully dynamic bin packing revisited
- Handbook of Approximation Algorithms and Metaheuristics
- scientific article; zbMATH DE number 4154224 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4125007 (Why is no real title available?)
- scientific article; zbMATH DE number 6865614 (Why is no real title available?)
- Improved Space for Bounded-Space, On-Line Bin-Packing
- Linear time-approximation algorithms for bin packing
- Lower and upper bounding procedures for the bin packing problem with concave loading cost
- More on ordered open end bin packing
- New Algorithms for Bin Packing
- New lower bounds for certain classes of bin packing algorithms
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- On the Asymptotic Worst Case Behavior of Harmonic Fit
- On the online bin packing problem
- On-line bin packing ? A restricted survey
- On-line bin packing in linear time
- Online algorithms. The state of the art
- Online Bin Packing with Cardinality Constraints
- Online cardinality constrained scheduling
- Online variable sized covering
- Optimal on-line algorithms for variable-sized bin covering
- Parallel solutions for ordinal scheduling with a small number of machines
- Parallel solutions for preemptive makespan scheduling on two identical machines
- Resource augmentation for online bounded space bin packing
- Solving robust bin-packing problems with a branch-and-price approach
- Tight performance bound of \(AFBk\) bin packing
- Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
- Two-bounded-space bin packing revisited
This page was built for publication: Tighter bounds for the harmonic bin packing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586257)
