IBM Journal of Research and Development · 1977 · 98 citations · 8 references
Natural SciencesComputer ScienceMathematicsCombinatoricsComputational GeometryOptimizationBin ManagementCombinatorial OptimizationBin PackingBin Packing ApproximationBin Packing ProblemPacking Problems
A comparative study is made of algorithms for a general multidimensional problem involving the packing of k-part objects in k compartments in a large supply of bins. The goal is to pack the objects using a minimum number of bins. The properties and limitations of the algorithms are discussed, including k-dimensional analogs of some popular one-dimensional algorithms. An application of the algorithms is the design of computer networks.
8
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
D. S. Johnson, Alan Demers, Jeffrey D. Ullman et al. · SIAM Journal on Computing · 1974 · 913 citations
Fast algorithms for bin packing
David S. Johnson · Journal of Computer and System Sciences · 1974 · 536 citations