Sciweavers

74 search results - page 3 / 15
» Problem Generators for Rectangular packing problems
Sort
View
EOR
2007
104views more  EOR 2007»
13 years 9 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
IPCO
2008
129views Optimization» more  IPCO 2008»
13 years 11 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
COR
2008
105views more  COR 2008»
13 years 10 months ago
Minimizing the object dimensions in circle and sphere packing problems
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
Ernesto G. Birgin, F. N. C. Sobral
4OR
2004
90views more  4OR 2004»
13 years 9 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
EOR
2007
78views more  EOR 2007»
13 years 9 months ago
A heuristic for the three-dimensional strip packing problem
The contribution presents a heuristic for the three-dimensional strip packing problem (3D-SPP) with rectangular pieces (boxes). The considered 3D-SPP can be formulated as follows:...
Andreas Bortfeldt, Daniel Mack