Batched bin packing
type: Item
instance of: scholarly article
title: Batched bin packing
zbMATH Open document ID: 1140.90476
author: G. Gutin
author: A. Yeo
author: T. R. Jensen
published in: Discrete Optimization
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2173497
zbMATH Keywords: On-line algorithm
zbMATH Keywords: Lower bounds
zbMATH Keywords: Bin packing
zbMATH Keywords: Competitive ratio
MaRDI profile type: Publication
full work available at URL: j.disopt.2004.11.001
OpenAlex ID: W1963608587
cites work: Does randomization help in on-line bin packing?
cites work: Q3145801
cites work: Q3002852
cites work: Online algorithms. The state of the art
cites work: Q4947393
cites work: Q3031924
cites work: Repacking helps in bounded space on-line bin-packing
cites work: Q4886075
cites work: Q5755519
cites work: Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
cites work: Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
cites work: A simple on-line bin-packing algorithm
cites work: A lower bound for on-line bin packing
cites work: An improved lower bound for on-line bin packing algorithms
cites work: New Algorithms for Bin Packing
cites work: An on-line bin-batching problem.
DOI: 10.1016/J.DISOPT.2004.11.001
description: scientific article; zbMATH DE number 2173497