scientific article; zbMATH DE number 1792275

MaRDI QIDQ4552137zbMATH OpenFDO

Authors Prabhu Manyem

Publication date 29 August 2002

zbMATH Keywords

uniform sized online bin packing

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Communication, information (94A99)

Recommendations

• Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
• scientific article; zbMATH DE number 2105043
• Optimal on-line algorithms for variable-sized bin covering
• On-line bin packing ? A restricted survey
• Performance estimations of first fit algorithm for online bin packing with variable bin sizes and LIB constraints

Cited in

(7)

• Colored bin packing: online algorithms and lower bounds
• scientific article; zbMATH DE number 1264403 (Why is no real title available?)
• scientific article; zbMATH DE number 2105043 (Why is no real title available?)
• Bin covering with a general profit function: approximability results
• Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
• On the sum minimization version of the online bin covering problem
• On online bin packing with LIB constraints

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 Q4552137)