نتایج جستجو برای: Strip packing

تعداد نتایج: 41913  

2006
Xin Han Kazuo Iwama Deshi Ye Guochuan Zhang

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 algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (MFFD) as a su...

Abdelghani Bekrar Chengbin Chu Imed Kacem

In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...

Journal: :CoRR 2017
Klaus Jansen Malin Rau

We study pseudo-polynomial Strip Packing. Given a set of rectangular axis parallel items and a strip with bounded width and infinite height the objective is to find a packing of the items into the strip which minimizes the packing height. We speak of pseudo-polynomial Strip Packing if we consider algorithms with pseudo-polynomial running time with respect to the width of the strip. It is known ...

Journal: :Discrete Applied Mathematics 1998
Wenceslas Fernandez de la Vega Vassilis Zissimopoulos

It is shown that for any positive E the strip-packing problem, i.e. the problem of packing a given list of rectangles into a strip of width 1 and minimum height. can be solled within I c 2: times the optimal height, in linear time, if the heights and widths of these rectangles are all bounded below by an absolute constant 2 >O. @ 1998 Elsevicr Science B.V. All rights reserved. K~YIYJY~/S: Strip...

Journal: :Comput. Geom. 2011
Rolf Harren Klaus Jansen Lars Prädel Rob van Stee

We study strip packing, which is one of the most classical two-dimensional packing problems: given a collection of rectangles, the problem is to find a feasible orthogonal packing without rotations into a strip of width 1 and minimum height. In this paper we present an approximation algorithm for the strip packing problem with absolute approximation ratio of 5/3 + ε for any ε > 0. This result s...

2009
Rolf Harren Rob van Stee

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 minimal height, respectively. All packings have to be non-overlapping and orthogonal, i.e., axisparallel. Our algorithm for strip packing has an absolute approximation ratio of 1.9396 and is the first algorithm to break the ap...

Journal: :Information and Computation 2016

Journal: :Theoretical Computer Science 2011

2015
Francisco Trespalacios Ignacio E. Grossmann

The two-dimensional strip packing is a special case of “Cutting and Packing” problems that arises in many applications. The problem seeks to pack a given set of rectangles into a strip of given width in order to minimize its length. Some applications in which the strip packing problem arises are: Cutting pieces from wooden boards, cutting pieces from glass or steel sheets, optimal layout of ind...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید