Fair versus unrestricted bin packing

DOI10.1007/S00453-002-0965-6zbMATH Open1001.68181OpenAlexW2024579090MaRDI QIDQ699764FDOQ699764

Authors: Yossi Azar, Joan Boyar, Leah Epstein, Kim S. Larsen, Lene M. Favrholdt 

Publication date: 25 September 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0965-6

Recommendations

• scientific article; zbMATH DE number 1617259
• scientific article; zbMATH DE number 2090002
• scientific article; zbMATH DE number 2016849
• Online algorithms for a dual version of bin packing
• scientific article; zbMATH DE number 1786227

zbMATH Keywords

first-fitdual bin packing problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial aspects of packing and covering (05B40)

Cited In (10)

• Title not available (Why is that?)
• Online knapsack revisited
• Tight bounds for online class-constrained packing
• Online-bounded analysis
• Online algorithms with advice for the dual bin packing problem
• Title not available (Why is that?)
• On the sum minimization version of the online bin covering problem
• Online bounded analysis
• Homogeneous grouping of non-prime steel products for online auctions: a case study
• Lower bounds on the performance of online algorithms for relaxed packing problems

This page was built for publication: Fair versus unrestricted bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699764)