scientific article; zbMATH DE number 2105043
From MaRDI portal
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)