Results 1  10
of
4,350
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.
A New Encoding Scheme for Rectangle Packing Problem
 PROC. OF ASPDAC 2000
, 2000
"... In the rectangle packing problem, encoding schemes to represent the placements of rectangles are the key factors of efficient algorithms. In 1995, an epochmaking encoding scheme, known as SEQPAIR, was developed[2]. The solution space of SEQPAIR has been considered sufficiently small. In this pa ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In the rectangle packing problem, encoding schemes to represent the placements of rectangles are the key factors of efficient algorithms. In 1995, an epochmaking encoding scheme, known as SEQPAIR, was developed[2]. The solution space of SEQPAIR has been considered sufficiently small
4Block Heuristic for the Rectangle Packing Problem
 European Journal of Operational Research
, 1996
"... 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 1 (0 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
Local Search Heuristics for the Rectangle Packing Problem With General . . .
 UNIVERSITY
, 2001
"... ..."
Corner Occupying Theorem for the Twodimensional Integral Rectangle Packing Problem
, 2011
"... This paper proves a corner occupying theorem for the twodimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container without overlapping, then we can achieve a feasible packing ..."
Abstract
 Add to MetaCart
This paper proves a corner occupying theorem for the twodimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container without overlapping, then we can achieve a feasible packing
A Novel Greedy Computing Algorithm for Rectangle Packing Problems
"... Rectangle packing problem often appears in encasement and cutting as well as layout of homepage or newspaper, etc. This problem has been shown to be NP hard. For solving this problem, many compute algorithms based on different strategies are presented in the literatures. A novelcomputing algorithm ..."
Abstract
 Add to MetaCart
Rectangle packing problem often appears in encasement and cutting as well as layout of homepage or newspaper, etc. This problem has been shown to be NP hard. For solving this problem, many compute algorithms based on different strategies are presented in the literatures. A novelcomputing algorithm
Using Tree Search Bounds To Enhance A Genetic Algorithm Approach To Two Rectangle Packing Problem
, 2004
"... A popular approach when using a geneticalgorithm in the solution of constrainedproblem is to exploitproblem specificinform#) by representing individuals as ordered lists. A construction heuristic is then often used as a decoder to produce a solutionfrom each ordering. In such a situation f ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
furtherinformPj#j is often available in theform of bounds on the partial solutions. This paper uses twotwodimGfiC)#PP packing problem to illustrate how thisinformtion can be incorporated into the genetic operators toimC()C the overallperformCjP of the search. Our objective is to use the packingproblem
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
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
Results 1  10
of
4,350