Worst-case analysis of the FFH algorithm for online variable-sized bin packing
From MaRDI portal
Publication:1909600
DOI10.1007/BF02309343zbMATH Open0843.90060MaRDI QIDQ1909600FDOQ1909600
Authors: Yanyan Li
Publication date: 17 March 1996
Published in: Computing (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (5)
- The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items
- A new version of on-line variable-sized bin packing
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
- Relaxations and exact solution of the variable sized bin packing problem
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
This page was built for publication: Worst-case analysis of the FFH algorithm for online variable-sized bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1909600)