Class constrained bin packing revisited

DOI10.1016/J.TCS.2010.04.037MaRDI QIDQ986543zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

online algorithmsbin packingAFPTAS

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05)

Recommendations

• Class constrained bin covering
• Colorful bin packing
• Variable sized bin packing with color constraints
• Bin packing under linear constraints
• Online colored bin packing

Cites work

• A simple on-line bin-packing algorithm
• AFPTAS results for common variants of bin packing: a new method for handling the small items
• Algorithms for on-line bin-packing problems with cardinality constraints
• An improved lower bound for on-line bin packing algorithms
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Approximation schemes for ordered vector packing problems
• Bin packing can be solved within 1+epsilon in linear time
• Cardinality constrained bin-packing problems
• On the online bin packing problem
• On two class-constrained versions of the multiple knapsack problem
• On-line bin packing in linear time
• Online Bin Packing with Cardinality Constraints
• Polynomial time approximation schemes for class-constrained packing problems
• The class constrained bin packing problem with applications to video-on-demand
• Tight bounds for online class-constrained packing

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
• An improved approximation scheme for variable-sized bin packing
• Online colored bin packing
• Bin packing with directed stackability conflicts
• 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)