Sciweavers

360 search results - page 2 / 72
» The TV-Break Packing Problem
Sort
View
ESA
2004
Springer
151views Algorithms» more  ESA 2004»
13 years 9 months ago
On Variable-Sized Multidimensional Packing
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
Leah Epstein, Rob van Stee
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 5 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
IPCO
2008
129views Optimization» more  IPCO 2008»
13 years 6 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
ORL
2006
91views more  ORL 2006»
13 years 5 months ago
Resource augmentation in two-dimensional packing with orthogonal rotations
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...
José R. Correa
IOR
2008
102views more  IOR 2008»
13 years 5 months ago
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be ex...
Alberto Ceselli, Giovanni Righini