Analysis of a Compound Bin Packing Algorithm
From MaRDI portal
Recommendations
Cited in
(15)- Algorithmic analysis of priority-based bin packing
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- Resource allocation under limited sharing
- Deep performance analysis of refined harmonic bin packing algorithm
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
- Modified subset sum heuristics for bin packing
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
- Between a rock and a hard place: the two-to-one assignment problem
- Single machine scheduling with job delivery to multiple customers
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- A linear compound algorithm for uniform machine scheduling
- On lazy bin covering and packing problems
- Analysis of a Hybrid Algorithm for Packing Unequal Bins
- scientific article; zbMATH DE number 1559404 (Why is no real title available?)
This page was built for publication: Analysis of a Compound Bin Packing Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200540)