Performance estimations of first fit algorithm for online bin packing with variable bin sizes and LIB constraints

MaRDI QIDQ5440937zbMATH OpenFDO

Authors

Publication date 5 February 2008

zbMATH Keywords

bin packing problemasymptotic worst case ratiolongest itemonline approximation algorithmuniform sized binsvariable sized bins

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25) Inventory, storage, reservoirs (90B05)

Recommendations

• On online bin packing with LIB constraints
• Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
• A new version of on-line variable-sized bin packing
• scientific article; zbMATH DE number 2105043

Cited in

(4)

• scientific article; zbMATH DE number 2105043 (Why is no real title available?)
• 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?)
• On online bin packing with LIB constraints

This page was built for publication: Performance estimations of first fit algorithm for online bin packing with variable bin sizes and LIB constraints

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