Sciweavers

12 search results - page 2 / 3
» MPQ-trees for orthogonal packing problem
Sort
View
EOR
2007
104views more  EOR 2007»
13 years 5 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
COR
2010
123views more  COR 2010»
13 years 5 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger
4OR
2004
90views more  4OR 2004»
13 years 5 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano
COMPGEOM
2004
ACM
13 years 10 months ago
Binary space partitions of orthogonal subdivisions
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
John Hershberger, Subhash Suri, Csaba D. Tó...
EOR
2006
93views more  EOR 2006»
13 years 5 months ago
A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
Given a set of rectangular pieces and a container of fixed width and variable length, the two-dimensional strip packing problem (2D-SPP) consists of orthogonally placing all the p...
Andreas Bortfeldt