Sciweavers

9 search results - page 1 / 2
» Two-dimensional packing problems: A survey
Sort
View
APPROX
2009
Springer
177views Algorithms» more  APPROX 2009»
13 years 11 months ago
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
Rolf Harren, Rob van Stee
IOR
2006
73views more  IOR 2006»
13 years 4 months ago
A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...
ASAP
2000
IEEE
90views Hardware» more  ASAP 2000»
13 years 9 months ago
Subword Permutation Instructions for Two-Dimensional Multimedia Processing in MicroSIMD Architectures
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...
Ruby B. Lee
CP
2003
Springer
13 years 9 months ago
A Two-Level Search Strategy for Packing Unequal Circles into a Circle Container
We propose a two-level search strategy to solve a two dimensional circle packing problem. At the first level, a good enough packing algorithm called
Wen Qi Huang, Yu Li, Bernard Jurkowiak, Chu Min Li...
EOR
2002
105views more  EOR 2002»
13 years 4 months ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci