A lower bound for on-line bin packing

1980/03/01 by Frank M. Liang · 8 citations
Computer Science · Engineering · Mathematics · #Advanced Manufacturing and Logistics Optimization #Algorithm #Approximation algorithm #Bin #Bin packing problem #Cardinality (data modeling) #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Constraint (computer-aided design) #Data mining #Discrete mathematics #Geometry #Line (geometry) #Mathematical analysis #Mathematics #Optimization and Packing Problems #Space (punctuation) #Upper and lower bounds

paper · doi:10.1016/s0020-0190(80)90077-0

crossref issued 1980/03/01 · crossref published 1980/03/01 · crossref published-print 1980/03/01 · openalex publication_date 1980/03/01 · crossref created 2002/07/26 · crossref deposited 2019/04/12 · openalex created_date 2025/10/10 · crossref indexed 2026/03/27 · openalex updated_date 2026/07/23

Citations

• New Algorithms for Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

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
• On-line bin packing in linear time
• A simple on-line bin-packing algorithm
• New lower bounds for certain classes of bin packing algorithms
• Bin packing problem [wikipedia]
• Sylvester's sequence [wikipedia]