Results 1  10
of
47,788
Incremental Move for StripPacking
 In Proc. ICTAI’07, int. conference on tools with articifcial intelligence, IEEE
, 2007
"... When handling 2D packing problems, numerous incomplete and complete algorithms maintain a socalled bottomleft (BL) property: every rectangle placed in a container is propped up bottom and left. While it is easy to make a rectangle BL when it is is added in a container, it is more expensive to mai ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
of “maximal holes”, which allows incremental additions and removals of rectangles. To validate our alternative approach, we have designed an incremental move, maintaining maximal holes, for the strippacking problem, a variant of the famous 2D binpacking. We have also implemented a generic metaheuris
A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular StripPacking Problem
"... This paper presents a binary search heuristic algorithm for the rectangular strippacking problem. The problem is to pack a number of rectangles into a sheet of given width and infinite height so as to minimize the required height. We first transform this optimization problem into a decision proble ..."
Abstract
 Add to MetaCart
This paper presents a binary search heuristic algorithm for the rectangular strippacking problem. The problem is to pack a number of rectangles into a sheet of given width and infinite height so as to minimize the required height. We first transform this optimization problem into a decision
Heuristics for the Strip Packing Problem with Unloading Constraints
, 2012
"... This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this problem, we are given a strip of fixed width and unbounded height, and n items of C different classes. As in the wellknown twodimensional Strip Packing problem, we have to pack all items minimizing the used ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this problem, we are given a strip of fixed width and unbounded height, and n items of C different classes. As in the wellknown twodimensional Strip Packing problem, we have to pack all items minimizing the used
Heuristics for Large Strip Packing Problems with Guillotine Patterns: an Empirical Study
, 2001
"... this paper we apply a variety of simple heuristics to strip packing problems with guillotine patterns (also known as slicing floorplans) and compare the results to those obtained using a genetic algorithm (GA). Although the GA performs well on smaller problem sizes, our results confirm that the simp ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
this paper we apply a variety of simple heuristics to strip packing problems with guillotine patterns (also known as slicing floorplans) and compare the results to those obtained using a genetic algorithm (GA). Although the GA performs well on smaller problem sizes, our results confirm
A metaheuristic algorithm for the strip rectangular packing problem
 Lecture Notes in Computer Science
, 2005
"... Abstract. A new metaheuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems ha ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. A new metaheuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems
An Improved Algorithm for the Strip Packing Problem
 Proceedings of the Federated Conference on Computer Science and Information Systems, FedCSIS 2012, Wroclaw
"... Abstract—This paper solves the strip packing problem (SPP) that consists in packing a set of circular objects into a rectangle of fixed width and unlimited length. The objective is to minimize the length of the rectangle that will contain all the objects such that no object overlaps another one. The ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—This paper solves the strip packing problem (SPP) that consists in packing a set of circular objects into a rectangle of fixed width and unlimited length. The objective is to minimize the length of the rectangle that will contain all the objects such that no object overlaps another one
Approximation schemes for strip packing
"... Abstract. We study two variants of the classical strip packing problem, or packing rectangles into a rectangle of fixed width and minimum height, a classical NPhard cutting stock problem. The first result presented in this paper is an OP T + O(1/ɛ 2) approximation scheme for resource augmented stri ..."
Abstract
 Add to MetaCart
Abstract. We study two variants of the classical strip packing problem, or packing rectangles into a rectangle of fixed width and minimum height, a classical NPhard cutting stock problem. The first result presented in this paper is an OP T + O(1/ɛ 2) approximation scheme for resource augmented
New Heuristic and Interactive Approaches to 2D Rectangular Strip Packing
, 2003
"... In this paper, we consider the twodimensional rectangular stripbenchmark problems. ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In this paper, we consider the twodimensional rectangular stripbenchmark problems.
Results 1  10
of
47,788