On-line bin packing in linear time

1989/09/01 by Prakash Ramanan, Donna J. Brown, Donna J Brown +3 · 4 citations
Computer Science · Engineering · Mathematics · #Advanced Manufacturing and Logistics Optimization #Algorithm #Bin #Bin packing problem #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Geometry #Line (geometry) #Mathematics #Optimization and Packing Problems

paper · doi:10.1016/0196-6774(89)90031-x

crossref issued 1989/09/01 · crossref published 1989/09/01 · crossref published-print 1989/09/01 · openalex publication_date 1989/09/01 · crossref created 2005/02/10 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2026/01/24 · openalex updated_date 2026/07/28

Citations

• New Algorithms for Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• A lower bound for on-line bin packing
• An efficient approximation scheme for the one-dimensional bin-packing problem

Cited by

• On-line bin packing ? A restricted survey
• On the online bin packing problem
• An improved lower bound for on-line bin packing algorithms
• Bin packing problem [wikipedia]