scientific article; zbMATH DE number 1792275
From MaRDI portal
Publication:4552137
zbMATH Open1002.68051MaRDI QIDQ4552137FDOQ4552137
Authors: Prabhu Manyem 
Publication date: 29 August 2002
Title of this publication is not available (Why is that?)
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Communication, information (94A99)
Cited In (7)
- Colored bin packing: online algorithms and lower bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
- Bin covering with a general profit function: approximability results
- 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)
