Pages that link to "Item:Q3189035"
From MaRDI portal
The following pages link to A new upper bound 2.5545 on 2D Online Bin Packing (Q3189035):
Displaying 11 items.
- Models for video-on-demand scheduling with costs (Q286685) (← links)
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing (Q744097) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- Efficient 1-space bounded hypercube packing algorithm (Q2205633) (← links)
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis (Q2217210) (← links)
- A lower bound for online rectangle packing (Q2331592) (← links)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing (Q2424663) (← links)
- Online bin packing of squares and cubes (Q5896890) (← links)
- Online bin packing of squares and cubes (Q5925713) (← links)