Linear time-approximation algorithms for bin packing
From MaRDI portal
Publication:1591548
DOI10.1016/S0167-6377(99)00077-2zbMath0960.90096MaRDI QIDQ1591548
Publication date: 20 May 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Bin packing with divisible item sizes and rejection penalties ⋮ Bin packing with rejection revisited ⋮ A 4-space bounded approximation algorithm for online bin packing problem ⋮ Efficient algorithms for real-life instances of the variable size bin packing problem ⋮ A 3-approximation algorithm for two-dimensional bin packing ⋮ NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation ⋮ NF-based algorithms for online bin packing with buffer and bounded item size
Cites Work
This page was built for publication: Linear time-approximation algorithms for bin packing