Pages that link to "Item:Q1909600"
From MaRDI portal
The following pages link to Worst-case analysis of the FFH algorithm for online variable-sized bin packing (Q1909600):
Displaying 5 items.
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- A new version of on-line variable-sized bin packing (Q674434) (← links)
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing (Q1299865) (← links)
- The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items (Q4521514) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)