Abstract
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 are considered. This problem has numerous applications in operations research and studies of computer operation. Efficient approximation algorithms are derived and their limitations are studies. Worst-case bounds are derived on the performance of the packings they produce.
Cite
CITATION STYLE
APA
Baker, B. S., Coffman, E. G., & Rivest, R. L. (1978). ORTHOGONAL PACKINGS IN TWO DIMENSIONS. In Proceedings - Annual Allerton Conference on Communication, Control, and Computing (pp. 626–635). https://doi.org/10.1137/0209064
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free