New Bounds for Variable-Sized Online Bin Packing
From MaRDI portal
Recommendations
Cited in
(19)- Bin packing with controllable item sizes
- Variable sized online interval coloring with bandwidth
- Lower bounds for a bin packing problem with linear usage cost
- Irreducible bin packing and normality in routing open shop
- Online bin packing with \((1,1)\) and \((2,R)\) bins
- A new variable-sized bin packing problem
- Bounds for online bin packing with cardinality constraints
- Online Bin Packing with (1,1) and (2,R) Bins
- A new upper bound 2.5545 on 2D Online Bin Packing
- Better Algorithms for Online Bin Stretching
- Vector bin packing with multiple-choice
- New lower bounds for certain classes of bin packing algorithms
- scientific article; zbMATH DE number 2086631 (Why is no real title available?)
- Tight bounds for restricted grid scheduling
- scientific article; zbMATH DE number 2217640 (Why is no real title available?)
- A new lower bound for classic online bin packing
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- A new version of on-line variable-sized bin packing
- An ILP-based exact approach for solving the variable cost and size bin packing problem with time-dependent cost modeling the shared satellite-based last-mile delivery
This page was built for publication: New Bounds for Variable-Sized Online Bin Packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706213)
