scientific article; zbMATH DE number 1786227

MaRDI QIDQ4547549zbMATH OpenFDO

Authors Kim S. Larsen, Morten N. Nielsen, Joan Boyar, Lene M. Favrholdt

Publication date 21 October 2002

zbMATH Keywords

on-line dual bin packing problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Online algorithms for a dual version of bin packing
• scientific article; zbMATH DE number 2016849
• scientific article; zbMATH DE number 2090002
• On-line bin packing with restricted repacking
• Fair versus unrestricted bin packing

Cited in

(7)

• Lower bounds on the performance of online algorithms for relaxed packing problems
• Online knapsack revisited
• Online unit profit knapsack with predictions
• An optimal algorithm for online multiple knapsack
• A survey of online knapsack problems
• Fair versus unrestricted bin packing
• Lower bounds on the performance of online algorithms for relaxed packing problems

This page was built for publication:

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