Pages that link to "Item:Q3766848"
From MaRDI portal
The following pages link to A simple on-line bin-packing algorithm (Q3766848):
Displayed 50 items.
- Selfish bin packing (Q534779) (← links)
- An on-line algorithm for variable-sized bin packing (Q582083) (← links)
- Average-case analysis of cutting and packing in two dimensions (Q582210) (← links)
- Dynamic multi-dimensional bin packing (Q616986) (← links)
- A note on online hypercube packing (Q623793) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- An on-line algorithm for multidimensional bin packing (Q688930) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- On the effectiveness of the harmonic shelf algorithm for on-line strip packing (Q932692) (← links)
- More on online bin packing with two item sizes (Q955329) (← links)
- Resource augmented semi-online bounded space bin packing (Q967321) (← links)
- Scheduling jobs on grid processors (Q973018) (← links)
- Tight results for next fit and worst fit with resource augmentation (Q974751) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- Class constrained bin packing revisited (Q986543) (← links)
- Bin packing with controllable item sizes (Q1004389) (← links)
- On-line grid-packing with a single active grid (Q1007524) (← links)
- A robust APTAS for the classical bin packing problem (Q1013966) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- A probabilistic analysis of the next fit decreasing bin packing heuristic (Q1085074) (← links)
- Online variable-sized bin packing (Q1111472) (← links)
- Average-case analysis of the smart next fit algorithm (Q1120280) (← links)
- Improved bounds for harmonic-based bin packing algorithms (Q1182320) (← links)
- An improved lower bound for on-line bin packing algorithms (Q1199958) (← links)
- Repacking helps in bounded space on-line bin-packing (Q1207048) (← links)
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case (Q1208477) (← links)
- Optimal on-line algorithms for variable-sized bin covering (Q1306350) (← links)
- Linear time-approximation algorithms for bin packing (Q1591548) (← links)
- Deep performance analysis of refined harmonic bin packing algorithm (Q1613251) (← links)
- Batched bin packing (Q1779689) (← links)
- Average-case analysis of the modified harmonic algorithm (Q1825655) (← links)
- Two-dimensional on-line bin packing problem with rotatable items. (Q1853573) (← links)
- Assigning service requests in voice-over-internet gateway multiprocessors (Q1886507) (← links)
- Algorithms for on-line bin-packing problems with cardinality constraints (Q1887058) (← links)
- A tight lower bound for optimal bin packing (Q1919179) (← links)
- Online bin packing with resource augmentation (Q2427692) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
- Bounds for online bounded space hypercube packing (Q2467129) (← links)
- Average case analysis of bounded space bin packing algorithms (Q2471807) (← links)
- The class constrained bin packing problem with applications to video-on-demand (Q2481969) (← links)
- Online square and cube packing (Q2570973) (← links)
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing (Q3004684) (← links)
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
- Selfish Bin Packing (Q3541100) (← links)
- On online bin packing with LIB constraints (Q3655570) (← links)
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← links)