The following pages link to (Q4723300):
Displaying 9 items.
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- Complexity of core allocation for the bin packing game (Q833586) (← links)
- Improved bounds for harmonic-based bin packing algorithms (Q1182320) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- A-shaped bin packing: Worst case analysis via simulation (Q2386612) (← links)
- Some inequalities for bin packing (Q3833329) (← links)
- New worst-case results for the bin-packing problem (Q4290987) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items (Q6090896) (← links)