On the sum minimization version of the online bin covering problem

DOI10.1016/J.DAM.2010.04.005zbMath1209.68636OpenAlexW1981351373MaRDI QIDQ987687

Csanád Imreh, Asaf Levin, Leah Epstein, János A. Csirik

Publication date: 13 August 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.04.005

zbMATH Keywords

online algorithmsbin covering

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (1)

Lower bounds and algorithms for the minimum cardinality bin covering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fair versus unrestricted bin packing
• Online algorithms for a dual version of bin packing
• On-line and off-line approximation algorithms for vector covering problems
• An asymptotic fully polynomial time approximation scheme for bin covering.
• Stochastic on-line knapsack problems
• On a dual version of the one-dimensional bin packing problem
• A Knapsack Secretary Problem with Applications
• Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems

This page was built for publication: On the sum minimization version of the online bin covering problem