Dual bin packing with items of random sizes
From MaRDI portal
Publication:1803607
Recommendations
Cites work
- An approximation of partial sums of independent RV'-s, and the sample DF. I
- Bin packing: Maximizing the number of pieces packed
- Martingale Inequalities and NP-Complete Problems
- Optimal Bin Packing with Items of Random Sizes
- Optimal Bin Packing with Items of Random Sizes II
- Optimal Bin Packing with Items of Random Sizes III
- Probabilistic analysis of a heuristic for the dual bin packing problem
- Probabilistic bounds for dual bin-packing
Cited in
(7)- Probabilistic bounds for dual bin-packing
- Lower bounds and algorithms for the minimum cardinality bin covering problem
- Probabilistic analysis of a heuristic for the dual bin packing problem
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Optimal Bin Packing with Items of Random Sizes III
- scientific article; zbMATH DE number 1515751 (Why is no real title available?)
- Random-order bin packing
This page was built for publication: Dual bin packing with items of random sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803607)