A 7160 theorem for bin packing

1985/10/01 by David S. Johnson, David S Johnson, M. R. Garey +1 · 2 citations
Computer Science · Engineering · Mathematics · #Algorithm #Bin #Bin packing problem #Combinatorics #Computational Geometry and Mesh Generation #Mathematical optimization #Mathematics #Optimization and Packing Problems #Simple (philosophy) #graph theory and CDMA systems

paper · pdf · doi:10.1016/0885-064x(85)90022-6

crossref issued 1985/10/01 · crossref published 1985/10/01 · crossref published-print 1985/10/01 · openalex publication_date 1985/10/01 · crossref created 2004/09/08 · crossref deposited 2019/02/04 · openalex created_date 2025/10/10 · crossref indexed 2026/01/11 · openalex updated_date 2026/08/02

Citations

• New Algorithms for Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• An efficient approximation scheme for the one-dimensional bin-packing problem
• A Linear Programming Approach to the Cutting-Stock Problem

Cited by

• A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm
• Bin packing problem [wikipedia]