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...
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...
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...
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...
— 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...