Results 1  10
of
202
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
An algebraic approach to rectangle packing
, 2008
"... A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of nonlinear equations is described. There are many interesting infinite rectangle packing problems that are studied. Some of them are: Packing of rectangles with side lengths ( 1 n, 1 n+ ..."
Abstract
 Add to MetaCart
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of nonlinear equations is described. There are many interesting infinite rectangle packing problems that are studied. Some of them are: Packing of rectangles with side lengths ( 1 n, 1 n
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
An Algebraic Approach To Rectangle Packing Problems
, 2008
"... A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described. ..."
Abstract
 Add to MetaCart
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.
Using global constraints for rectangle packing
 In Proceedings of the first Workshop on Bin Packing and Placement Constraints BPPC’08
, 2008
"... Abstract. In this paper we solve the optimal rectangle packing problem using Cumulative and Disjoint2 constraints in SICStus Prolog with a novel decomposition method, together with a specialized search routine and various model enhancements. We improve the best known runtimes by up to a factor of 30 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In this paper we solve the optimal rectangle packing problem using Cumulative and Disjoint2 constraints in SICStus Prolog with a novel decomposition method, together with a specialized search routine and various model enhancements. We improve the best known runtimes by up to a factor
New Improvements in Optimal Rectangle Packing
"... The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our algorithm picks the xcoordinates of all the rectangles before picking any of the ycoordinates. For the xcoordinates, we present a dynamic varia ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our algorithm picks the xcoordinates of all the rectangles before picking any of the ycoordinates. For the xcoordinates, we present a dynamic
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
RectanglePackingBased Module Placement
, 1997
"... ... This paper proposes such a solution space whereeach packing is represented by a pair of module name sequences. Searching this space by simulated annealing, hundreds of modules could be successfully packed as demonstrated. Combining a conventional wiring method, the biggest MCNC benchmark ami49 i ..."
Abstract

Cited by 73 (5 self)
 Add to MetaCart
... This paper proposes such a solution space whereeach packing is represented by a pair of module name sequences. Searching this space by simulated annealing, hundreds of modules could be successfully packed as demonstrated. Combining a conventional wiring method, the biggest MCNC benchmark ami49
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
Results 1  10
of
202