Orthogonal Packings in Two Dimensions

  • Baker B
  • Coffman, Jr. E
  • Rivest R
  • 63


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Brenda S. Baker

  • E. G. Coffman, Jr.

  • Ronald L. Rivest

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free