Title

Multidimensional Bin Packing Algorithms.

Abstract

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.

Department(s)

Computer Science

Keywords and Phrases

Mathematical Programming

International Standard Serial Number (ISSN)

0018-8646

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 1977 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Share

 
COinS