Pages that link to "Item:Q4051589"
From MaRDI portal
The following pages link to Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (Q4051589):
Displayed 17 items.
- Exact and approximate methods for a one-dimensional minimax bin-packing problem (Q363606) (← links)
- Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations (Q385496) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Selfish bin packing with cardinality constraints (Q391143) (← links)
- Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
- On the absolute approximation ratio for first fit and related results (Q442205) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem (Q580978) (← links)
- Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685) (← links)
- A note on online hypercube packing (Q623793) (← links)
- A new version of on-line variable-sized bin packing (Q674434) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing (Q744097) (← links)
- A storage-size selection problem (Q795502) (← links)
- Bin packing with rejection revisited (Q848845) (← links)
- Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)