This side up!

Leah Epstein; Rob Van Stee

doi:10.1007/978-3-540-31833-0_6

This side up!

Research output: Contribution to journal › Conference 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)	48-60
Number of pages	13
Journal	Lecture Notes in Computer Science
Volume	3351
DOIs	https://doi.org/10.1007/978-3-540-31833-0_6
State	Published - 2005
Externally published	Yes
Event	Second International Workshop on Approximation and Online Algorithms, WAOA 2004 - Bergen, Norway Duration: 14 Sep 2004 → 16 Sep 2004

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-31833-0_6

Cite this

@article{ea54a6526f0141adacc0117fbe029728,

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.",

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

year = "2005",

doi = "10.1007/978-3-540-31833-0_6",

language = "English",

volume = "3351",

pages = "48--60",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "Second International Workshop on Approximation and Online Algorithms, WAOA 2004 ; Conference date: 14-09-2004 Through 16-09-2004",

}

TY - JOUR

T1 - This side up!

AU - Epstein, Leah

AU - Van Stee, Rob

PY - 2005

Y1 - 2005

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.

UR - http://www.scopus.com/inward/record.url?scp=23944488325&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-31833-0_6

DO - 10.1007/978-3-540-31833-0_6

M3 - Conference article

AN - SCOPUS:23944488325

SN - 0302-9743

VL - 3351

SP - 48

EP - 60

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - Second International Workshop on Approximation and Online Algorithms, WAOA 2004

Y2 - 14 September 2004 through 16 September 2004

ER -

This side up!

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this