Sciweavers

44 search results - page 1 / 9
» On strip packing With rotations
Sort
View
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
13 years 10 months ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
WAOA
2004
Springer
142views Algorithms» more  WAOA 2004»
13 years 10 months ago
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 p...
Leah Epstein, Rob van Stee
APPROX
2009
Springer
177views Algorithms» more  APPROX 2009»
13 years 11 months ago
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
Rolf Harren, Rob van Stee
AAIM
2007
Springer
103views Algorithms» more  AAIM 2007»
13 years 11 months ago
Strip Packing vs. Bin Packing
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithm...
Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
CEC
2007
IEEE
13 years 11 months ago
Multi-objective strip packing using an evolutionary algorithm
— Good algorithms exist for solving the strip packing problem when the objective is to minimise the amount of wasted material. We describe a multi-objective evolutionary algorith...
Simon Illich, R. Lyndon While, Luigi Barone