scientific article; zbMATH DE number 2105043

MaRDI QIDQ4820876zbMATH OpenFDO

Authors Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser

Publication date 1 October 2004

zbMATH Keywords

bin packing problemasymptotic worst case ratiobin covering problemlongest itemonline approximation algorithmuniform sized bins

Mathematics Subject Classification ID

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)

Recommendations

• Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
• On online bin packing with LIB constraints
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
• scientific article; zbMATH DE number 1792275
• Performance estimations of first fit algorithm for online bin packing with variable bin sizes and LIB constraints

Cited in

(11)

• Online results for black and white bin packing
• Colored bin packing: online algorithms and lower bounds
• Online bin covering: expectations vs. guarantees
• Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
• scientific article; zbMATH DE number 1792275 (Why is no real title available?)
• Performance estimations of first fit algorithm for online bin packing with variable bin sizes and LIB constraints
• On online bin packing with LIB constraints
• Probabilistic analysis of online (class-constrained) bin packing and bin covering
• Bin packing with directed stackability conflicts
• Online Bin Covering: Expectations vs. Guarantees
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820876)