scientific article
From MaRDI portal
Publication:2768348
zbMath1018.90037MaRDI QIDQ2768348
János A. Csirik, Claire M. Kenyon, David S. Johnson
Publication date: 24 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Combinatorial aspects of packing and covering (05B40)
Related Items (20)
Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Ordinal Maximin Share Approximation for Goods ⋮ An Incentive Mechanism for Selfish Bin Covering ⋮ Online bin covering with limited migration ⋮ Selfish bin covering ⋮ Bin covering with cardinality constraints ⋮ An asymptotic fully polynomial time approximation scheme for bin covering. ⋮ Class constrained bin covering ⋮ Asymptotic fully polynomial approximation schemes for variants of open-end bin packing ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ On the sum minimization version of the online bin covering problem ⋮ The maximum resource bin packing problem ⋮ Packing resizable items with application to video delivery over wireless networks ⋮ Online Bin Covering with Limited Migration ⋮ Hardness of lazy packing and covering ⋮ Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing ⋮ Hardness of approximation for orthogonal rectangle packing and covering problems ⋮ Bounded-space online bin cover ⋮ The generalized assignment problem with minimum quantities
This page was built for publication:
