Hardness of lazy packing and covering
type: Item
instance of: scholarly article
title: Hardness of lazy packing and covering
zbMATH Open document ID: 1159.90473
author: Ling Gai
author: Guochuan Zhang
published in: Operations Research Letters
publication date: 2009-05-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5552067
zbMATH Keywords: bin packing
zbMATH Keywords: bin covering
zbMATH Keywords: \(\mathcal{NP}\)-hardness
MaRDI profile type: Publication
full work available at URL: j.orl.2008.12.007
OpenAlex ID: W2037096763
cites work: Q3347319
cites work: On a dual version of the one-dimensional bin packing problem
cites work: Better approximation algorithms for bin covering
cites work: A note on an open-end bin packing problem
cites work: Parameterized on-line open-end bin packing
cites work: The lazy bureaucrat scheduling problem
cites work: The maximum resource bin packing problem
cites work: On Lazy Bin Covering and Packing Problems
cites work: Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
cites work: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
DOI: 10.1016/J.ORL.2008.12.007
description: scientific article; zbMATH DE number 5552067