Pages that link to "Item:Q1332349"
From MaRDI portal
The following pages link to Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (Q1332349):
Displaying 11 items.
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- Worst-case analysis of fast heuristics for packing squares into a square (Q1365944) (← links)
- Stochastic simulations of two-dimensional composite packings (Q1372030) (← 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)
- On-line bin packing ? A restricted survey (Q4845093) (← links)
- On two dimensional packing (Q5054823) (← links)
- Online bin packing of squares and cubes (Q5896890) (← links)
- Online bin packing of squares and cubes (Q5925713) (← links)