scientific article; zbMATH DE number 2105043
From MaRDI portal
Publication:4820876
zbMath1088.68836MaRDI QIDQ4820876
Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser
Publication date: 1 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bin packing problemasymptotic worst case ratiobin covering problemlongest itemonline approximation algorithmuniform sized bins
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (6)
Bin packing with ``largest in bottom constraint: tighter bounds and generalizations ⋮ Colored bin packing: online algorithms and lower bounds ⋮ Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing ⋮ On online bin packing with LIB constraints ⋮ Bin packing with directed stackability conflicts ⋮ Online results for black and white bin packing
This page was built for publication:
