Pages that link to "Item:Q5946401"

The following pages link to Bounded space on-line bin packing: Best is better than first (Q5946401):

Displaying 17 items.

• On-line algorithms for 2-space bounded 2-dimensional bin packing (Q456101) (← links)
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing (Q744097) (← links)
• On lazy bin covering and packing problems (Q1041247) (← links)
• Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
• Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
• Efficient 1-space bounded hypercube packing algorithm (Q2205633) (← links)
• A note on one-space bounded square packing (Q2353640) (← links)
• Locality-preserving allocations problems and coloured bin packing (Q2355699) (← links)
• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems (Q2379919) (← links)
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
• Average case analysis of bounded space bin packing algorithms (Q2471807) (← links)
• Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing (Q3004684) (← links)
• ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
• Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing (Q3186043) (← links)
• Online Colored Bin Packing (Q3453281) (← links)
• A 4-space bounded approximation algorithm for online bin packing problem (Q6113869) (← links)
• Tighter bounds for the harmonic bin packing algorithm (Q6586257) (← links)