Tighter bounds for the harmonic bin packing algorithm

Cites Work

New lower bounds for certain classes of bin packing algorithms
An on-line algorithm for variable-sized bin packing
Best \(k\)-fit bin packing
A robust APTAS for the classical bin packing problem
Online algorithms. The state of the art
A lower bound for on-line bin packing
Bin packing can be solved within 1+epsilon in linear time
An improved lower bound for on-line bin packing algorithms
Optimal on-line algorithms for variable-sized bin covering
Tight performance bound of \(AFBk\) bin packing
Linear time-approximation algorithms for bin packing
A generalized bin packing problem for parcel delivery in last-mile logistics
Fast algorithms for bin packing
Online variable sized covering
Algorithms for on-line bin-packing problems with cardinality constraints
Number of bins and maximum lateness minimization in two-dimensional bin packing
A bin packing approach to solve the aircraft maintenance task allocation problem
Solving robust bin-packing problems with a branch-and-price approach
A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays
More on ordered open end bin packing
Four decades of research on the open-shop scheduling problem to minimize the makespan
Fully dynamic bin packing revisited
Bin packing problem with scenarios
Bounds for online bin packing with cardinality constraints
A note on a variant of the online open end bin packing problem
A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
Two-Bounded-Space Bin Packing Revisited
Handbook of Approximation Algorithms and Metaheuristics
On the online bin packing problem
All-Around Near-Optimal Solutions for the Online Bin Packing Problem
A simple on-line bin-packing algorithm
New Algorithms for Bin Packing
Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
Improved Space for Bounded-Space, On-Line Bin-Packing
Beating the Harmonic Lower Bound for Online Bin Packing
On-line bin packing in linear time
Resource augmentation for online bounded space bin packing
On-line bin packing ? A restricted survey
On the Asymptotic Worst Case Behavior of Harmonic Fit
A Robust AFPTAS for Online Bin Packing with Polynomial Migration
Online Bin Packing with Cardinality Constraints
Adaptive Bin Packing with Overflow
A new lower bound for classic online bin packing
Bounded space on-line bin packing: Best is better than first
Lower and upper bounding procedures for the bin packing problem with concave loading cost
Parallel solutions for preemptive makespan scheduling on two identical machines
A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
Parallel solutions for ordinal scheduling with a small number of machines
Online cardinality constrained scheduling
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item

This page was built for publication: Tighter bounds for the harmonic bin packing algorithm