Sciweavers

360 search results - page 1 / 72
» The TV-Break Packing Problem
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
SIU
2002
97views more  SIU 2002»
13 years 4 months ago
Problem Generators for Rectangular packing problems
Abstract. In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for...
E. Hopper, B. C. H. Turton
CP
2010
Springer
13 years 3 months ago
Propagating the Bin Packing Constraint Using Linear Programming
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
Hadrien Cambazard, Barry O'Sullivan
WAOA
2004
Springer
142views Algorithms» more  WAOA 2004»
13 years 10 months ago
This Side Up!
Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In p...
Leah Epstein, Rob van Stee
DCG
2008
81views more  DCG 2008»
13 years 4 months ago
A Dense Packing of Regular Tetrahedra
We construct a dense packing of regular tetrahedra, with packing density D > .7786157. Keywords Crystallography
Elizabeth R. Chen