We consider problems of packing an arbitrary collection of rectangular pieces into an open-ended, rectangular bin so as to minimize the height achieved by any piece. This problem has numerous applications in operations research and studies of computer operation. We devise efficient approximation algorithms, study their limitations, and derive worst-case bounds on the performance of the packings they produce.
No takes yet. Share an insight, caveat, or question.
Baker et al. (1980) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: