Results 1  10
of
119,623
Maximizing the Total Profit of Rectangles Packed into a Rectangle
, 2007
"... We consider the following rectangle packing problem. Given a set of rectangles, each of which is associated with a profit, we are requested to pack a subset of the rectangles into a bigger rectangle so that the total profit of rectangles packed is maximized. The rectangles may not overlap. This pr ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
We consider the following rectangle packing problem. Given a set of rectangles, each of which is associated with a profit, we are requested to pack a subset of the rectangles into a bigger rectangle so that the total profit of rectangles packed is maximized. The rectangles may not overlap
Rectangles)
"... We consider the following problem motivated by an application in computational molecular biology. We are given a set of weighted axisparallel rectangles such that for any pair of rectangles and either axis, the projection of one rectangle does not enclose that of the other. Dene a pair to be indepe ..."
Abstract
 Add to MetaCart
We consider the following problem motivated by an application in computational molecular biology. We are given a set of weighted axisparallel rectangles such that for any pair of rectangles and either axis, the projection of one rectangle does not enclose that of the other. Dene a pair
On Packing Rectangles with Resource Augmentation: Maximizing the Profit
 ALGORITHMIC OPERATIONS RESEARCH VOL.3 (2008) 1–12
, 2008
"... We consider the problem of packing rectangles with profits into a bounded square region so as to maximize their total profit. More specifically, given a set R of n rectangles with positive profits, it is required to pack a subset of them into a unit size square frame [0,1] × [0,1] so that the total ..."
Abstract
 Add to MetaCart
We consider the problem of packing rectangles with profits into a bounded square region so as to maximize their total profit. More specifically, given a set R of n rectangles with positive profits, it is required to pack a subset of them into a unit size square frame [0,1] × [0,1] so that the total
Weighted Rectangle and Cuboid Packing
, 2005
"... Given a set of rectangular items, all of them associated with a profit, and a single bigger rectangular bin, we can ask to find a nonrotational, nonoverlapping packing of a selection of these items into the bin to maximize the profit. A detailed description of the (2 + ɛ)approximation algorithm o ..."
Abstract
 Add to MetaCart
Given a set of rectangular items, all of them associated with a profit, and a single bigger rectangular bin, we can ask to find a nonrotational, nonoverlapping packing of a selection of these items into the bin to maximize the profit. A detailed description of the (2 + ɛ)approximation algorithm
On weighted rectangle packing with large resources
 Proc. 3rd IFIP International Conference on Theoretical Computer Science
, 2004
"... Abstract We study the problem of packing a set ofÒrectangles with weights into a dedicated rectangle so that the weight of the packed rectangles is maximized. We consider the case of large resources, that is, the side length of all rectangles is at most and the side lengths of the dedicated rectangl ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract We study the problem of packing a set ofÒrectangles with weights into a dedicated rectangle so that the weight of the packed rectangles is maximized. We consider the case of large resources, that is, the side length of all rectangles is at most and the side lengths of the dedicated
On Packing Of Squares Into A Rectangle
, 1996
"... . It is proved in this paper that any system of squares with total area 1 may be packed into a rectangle whose area is less then 1:53: The following problem is formulated in [7]: Determine the smallest number S such that any system of squares with total area 1 may be (parallelly) packed into a rect ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
rectangle of area S: This problem was posed by L. Moser [4]. S 1+ p 2 2 =1:207 follows from considering two squares of sides x and y, where x ? y; x 2 + y 2 = 1 and x(x + y) is maximal. Novotn'y [8] proved that any system of three squares with total area 1 may be packed into a rectangle
Heuristics for the Rectangle Packing Problem
, 1995
"... In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4heuristic for the pallet loading p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4heuristic for the pallet loading
Search strategies for rectangle packing
 of Lecture Notes in Computer Science
, 2008
"... Abstract. Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a variant of an important problem in a variety of realworld settings. For example, in electronic design automati ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
Abstract. Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a variant of an important problem in a variety of realworld settings. For example, in electronic design
Packing Random Rectangles
, 2000
"... A random rectangle is the product of two independent random intervals, each being the interval between two random points drawn independently and uniformly from [0; 1]. We prove that the number C n of items in a maximum cardinality disjoint subset of n random rectangles satisfies n 1=2 =K EC n K ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A random rectangle is the product of two independent random intervals, each being the interval between two random points drawn independently and uniformly from [0; 1]. We prove that the number C n of items in a maximum cardinality disjoint subset of n random rectangles satisfies n 1=2 =K EC n
Results 1  10
of
119,623