Pages that link to "Item:Q1149248"
From MaRDI portal
The following pages link to Probabilistic analysis for simple one- and two-dimensional bin packing algorithms (Q1149248):
Displaying 15 items.
- A two-phase heuristic for strip packing: Algorithm and probabilistic analysis (Q579140) (← links)
- Probabilistic behaviour of optimal bin-packing solutions (Q797494) (← links)
- An O(n) bin-packing algorithm for uniformly distributed data (Q1065544) (← links)
- A 71/60 theorem for bin packing (Q1083194) (← links)
- Bin packing as a random walk: A note on Knödel's paper (Q1084021) (← links)
- The average-case analysis of some on-line algorithms for bin packing (Q1100912) (← links)
- Packing items from a triangular distribution (Q1107981) (← links)
- Average-case analysis of the smart next fit algorithm (Q1120280) (← links)
- Expected performance of the shelf heuristic for 2-dimensional packing (Q1121176) (← links)
- A class of simple stochastic online bin packing algorithms (Q1161297) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Average-case analysis of the modified harmonic algorithm (Q1825655) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- FFD bin packing for item sizes with uniform distributions on \([0,\frac12]\). (Q2641215) (← links)
- Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems (Q3747714) (← links)
