Class constrained bin packing revisited
From MaRDI portal
Publication:986543
DOI10.1016/J.TCS.2010.04.037zbMATH Open1196.68311OpenAlexW2050319410MaRDI QIDQ986543FDOQ986543
Authors: 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
Recommendations
Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05)
Cites Work
- Bin packing can be solved within 1+epsilon in linear time
- Cardinality constrained bin-packing problems
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- An improved lower bound for on-line bin packing algorithms
- Algorithms for on-line bin-packing problems with cardinality constraints
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- On-line bin packing in linear time
- Online Bin Packing with Cardinality Constraints
- Approximation schemes for ordered vector 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
- Polynomial time approximation schemes for class-constrained packing problems
- Tight bounds for online class-constrained packing
- On two class-constrained versions of the multiple knapsack problem
Cited In (17)
- A heuristic for the problem of one-dimensional steel coil cutting
- Class constrained bin covering
- Bincoloring
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
- Polynomial time approximation schemes for class-constrained packing problems
- Locality-preserving allocations problems and coloured bin packing
- Priority-based bin packing with subset constraints
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- Variable sized bin packing with color constraints
- An AFPTAS for variable sized bin packing with general activation costs
- A one-dimensional bin packing problem with shelf divisions
- VNS matheuristic for a bin packing problem with a color constraint
- Online colored bin packing
- Bin packing with directed stackability conflicts
- An improved approximation scheme for variable-sized bin packing
- Bounds for online bin packing with cardinality constraints
- Bin packing under linear constraints
This page was built for publication: Class constrained bin packing revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986543)
