Hardness of lazy packing and covering

DOI10.1016/j.orl.2008.12.007zbMath1159.90473OpenAlexW2037096763MaRDI QIDQ1015303

Ling Gai, Guo-Chuan Zhang

Publication date: 7 May 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.12.007

zbMATH Keywords

bin coveringbin packing\(\mathcal{NP}\)-hardness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items

Open-end bin packing: new and old analysis approaches ⋮ A note on a variant of the online open end bin packing problem ⋮ An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem ⋮ Online lazy bureaucrat scheduling with a machine deadline ⋮ More on ordered open end bin packing ⋮ On lazy bin covering and packing problems

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
• Parameterized on-line open-end bin packing
• The lazy bureaucrat scheduling problem
• The maximum resource bin packing problem
• On a dual version of the one-dimensional bin packing problem
• On Lazy Bin Covering and Packing Problems
• Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
• A note on an open-end bin packing problem

This page was built for publication: Hardness of lazy packing and covering