7 search results - page 1 / 2 » Approximation Algorithms for 3D Orthogonal Knapsack |
TAMC
2007
Springer
13 years 10 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
IWCIA
2004
Springer
13 years 10 months ago
2004
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
DGCI
2005
Springer
13 years 10 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
CAIP
2005
Springer
13 years 10 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
CEC
2007
IEEE
13 years 8 months ago
2007
IEEE
This paper presents an approach for constructing improved visual representations of high dimensional objective spaces using virtual reality. These spaces arise from the solution of...