Class constrained bin packing revisited
From MaRDI portal
Publication:986543
DOI10.1016/j.tcs.2010.04.037zbMath1196.68311OpenAlexW2050319410MaRDI QIDQ986543
Leah Epstein, Csanád Imreh, Asaf Levin
Publication date: 11 August 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.037
Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (9)
Bounds for online bin packing with cardinality constraints ⋮ The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints ⋮ Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms ⋮ An AFPTAS for variable sized bin packing with general activation costs ⋮ A heuristic for the problem of one-dimensional steel coil cutting ⋮ An improved approximation scheme for variable-sized bin packing ⋮ Lower bounds for several online variants of bin packing ⋮ Bin packing with directed stackability conflicts ⋮ Locality-preserving allocations problems and coloured bin packing
Cites Work
- Tight bounds for online class-constrained packing
- Bin packing can be solved within 1+epsilon in linear time
- An improved lower bound for on-line bin packing algorithms
- Polynomial time approximation schemes for class-constrained packing problems
- Algorithms for on-line bin-packing problems with cardinality constraints
- Cardinality constrained bin-packing problems
- The class constrained bin packing problem with applications to video-on-demand
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Approximation schemes for ordered vector packing problems
- On-line bin packing in linear time
- Online Bin Packing with Cardinality Constraints
- On two class-constrained versions of the multiple knapsack problem
This page was built for publication: Class constrained bin packing revisited
