This side up!

Leah Epstein; Rob Van Stee

doi:10.1145/1150334.1150339

This side up!

Leah Epstein
, Rob Van Stee

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We consider two- and three-dimensional bin-packing problems where 90° rotations are allowed. We improve all known asymptotic performance bounds for these problems. In particular, we show how to combine ideas from strip packing and two-dimensional bin packing to give a new algorithm for the three-dimensional strip packing problem where boxes can only be rotated sideways. We propose to call this problem "This side up". Our algorithm has an asymptotic performance bound of 9/4.

Original language	English
Pages (from-to)	228-243
Number of pages	16
Journal	ACM Transactions on Algorithms
Volume	2
Issue number	2
DOIs	https://doi.org/10.1145/1150334.1150339
State	Published - 2006

Keywords

Bin packing
Online algorithms
Rotations

ASJC Scopus subject areas

Mathematics (miscellaneous)

Access to Document

10.1145/1150334.1150339

Cite this

@article{a904ef5ef43f4636a17a2438a509906d,

title = "This side up!",

abstract = "We consider two- and three-dimensional bin-packing problems where 90° rotations are allowed. We improve all known asymptotic performance bounds for these problems. In particular, we show how to combine ideas from strip packing and two-dimensional bin packing to give a new algorithm for the three-dimensional strip packing problem where boxes can only be rotated sideways. We propose to call this problem {"}This side up{"}. Our algorithm has an asymptotic performance bound of 9/4.",

keywords = "Bin packing, Online algorithms, Rotations",

author = "Leah Epstein and \{Van Stee\}, Rob",

year = "2006",

doi = "10.1145/1150334.1150339",

language = "English",

volume = "2",

pages = "228--243",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - This side up!

AU - Epstein, Leah

AU - Van Stee, Rob

PY - 2006

Y1 - 2006

N2 - We consider two- and three-dimensional bin-packing problems where 90° rotations are allowed. We improve all known asymptotic performance bounds for these problems. In particular, we show how to combine ideas from strip packing and two-dimensional bin packing to give a new algorithm for the three-dimensional strip packing problem where boxes can only be rotated sideways. We propose to call this problem "This side up". Our algorithm has an asymptotic performance bound of 9/4.

AB - We consider two- and three-dimensional bin-packing problems where 90° rotations are allowed. We improve all known asymptotic performance bounds for these problems. In particular, we show how to combine ideas from strip packing and two-dimensional bin packing to give a new algorithm for the three-dimensional strip packing problem where boxes can only be rotated sideways. We propose to call this problem "This side up". Our algorithm has an asymptotic performance bound of 9/4.

KW - Bin packing

KW - Online algorithms

KW - Rotations

UR - https://www.scopus.com/pages/publications/33747742491

U2 - 10.1145/1150334.1150339

DO - 10.1145/1150334.1150339

M3 - Article

AN - SCOPUS:33747742491

SN - 1549-6325

VL - 2

SP - 228

EP - 243

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 2

ER -

This side up!

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this