On the sum minimization version of the online bin covering problem
type: Item
instance of: scholarly article
title: On the sum minimization version of the online bin covering problem
zbMATH Open document ID: 1209.68636
author: Leah Epstein
author: Csanád Imreh
author: Asaf Levin
author: János Csirik
published in: Discrete Applied Mathematics
publication date: 2010-08-13T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5770512
zbMATH Keywords: online algorithms
zbMATH Keywords: bin covering
MaRDI profile type: Publication
full work available at URL: j.dam.2010.04.005
OpenAlex ID: W1981351373
cites work: On-line and off-line approximation algorithms for vector covering problems
cites work: On a dual version of the one-dimensional bin packing problem
cites work: Fair versus unrestricted bin packing
cites work: A Knapsack Secretary Problem with Applications
cites work: Better approximation algorithms for bin covering
cites work: Online algorithms for a dual version of bin packing
cites work: Q4439453
cites work: Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
cites work: Q4737165
cites work: An asymptotic fully polynomial time approximation scheme for bin covering.
cites work: Average-Case Analysis of Off-Line and On-Line Knapsack Problems
cites work: Stochastic on-line knapsack problems
DOI: 10.1016/J.DAM.2010.04.005
description: scientific article; zbMATH DE number 5770512