Pages that link to "Item:Q3069730"
From MaRDI portal
The following pages link to ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730):
Displaying 8 items.
- On-line algorithms for 2-space bounded 2-dimensional bin packing (Q456101) (← links)
- Efficient 1-space bounded hypercube packing algorithm (Q2205633) (← links)
- A note on one-space bounded square packing (Q2353640) (← links)
- Drawer algorithms for 1-space bounded multidimensional hyperbox packing (Q2424663) (← links)
- Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing (Q3186043) (← links)
- On a dual version of the one-dimensional bin packing problem (Q3219761) (← links)
- A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem (Q6487995) (← links)
- A multi-start gradient combination method for high-performance global search (Q6542986) (← links)