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.
No takes yet. Share an insight, caveat, or question.
Kou et al. (1977) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: