| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141893 | Discrete Optimization | 2007 | 13 Pages |
Abstract
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2,…,72,…,7.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Leah Epstein, Rob van Stee,