Pages that link to "Item:Q3960135"
From MaRDI portal
The following pages link to A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing (Q3960135):
Displayed 11 items.
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem (Q580978) (← links)
- A new version of on-line variable-sized bin packing (Q674434) (← links)
- More on online bin packing with two item sizes (Q955329) (← links)
- A probabilistic analysis of the next fit decreasing bin packing heuristic (Q1085074) (← links)
- Probabilistic analysis of the next fit decreasing algorithm for bin- packing (Q1093532) (← links)
- Next-fit packs a list and its reverse into the same number of bins (Q1109684) (← links)
- Packing problems (Q1197916) (← links)
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case (Q1208477) (← links)
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle (Q3222847) (← links)
- Parametric Lower Bound for On-Line Bin-Packing (Q3724089) (← links)